About the Execution of ITS-Tools for CircularTrains-PT-384
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8391.607 | 3600000.00 | 6114865.00 | 7044.30 | FF?TF?FF?TFF??FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r069-smll-167814396100188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CircularTrains-PT-384, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396100188
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.1K Feb 26 04:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 04:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 04:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 26 04:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 293K Mar 5 18:22 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-384-LTLFireability-00
FORMULA_NAME CircularTrains-PT-384-LTLFireability-01
FORMULA_NAME CircularTrains-PT-384-LTLFireability-02
FORMULA_NAME CircularTrains-PT-384-LTLFireability-03
FORMULA_NAME CircularTrains-PT-384-LTLFireability-04
FORMULA_NAME CircularTrains-PT-384-LTLFireability-05
FORMULA_NAME CircularTrains-PT-384-LTLFireability-06
FORMULA_NAME CircularTrains-PT-384-LTLFireability-07
FORMULA_NAME CircularTrains-PT-384-LTLFireability-08
FORMULA_NAME CircularTrains-PT-384-LTLFireability-09
FORMULA_NAME CircularTrains-PT-384-LTLFireability-10
FORMULA_NAME CircularTrains-PT-384-LTLFireability-11
FORMULA_NAME CircularTrains-PT-384-LTLFireability-12
FORMULA_NAME CircularTrains-PT-384-LTLFireability-13
FORMULA_NAME CircularTrains-PT-384-LTLFireability-14
FORMULA_NAME CircularTrains-PT-384-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678303637582
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 19:27:19] [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]
[2023-03-08 19:27:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:27:20] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-08 19:27:20] [INFO ] Transformed 768 places.
[2023-03-08 19:27:20] [INFO ] Transformed 384 transitions.
[2023-03-08 19:27:20] [INFO ] Parsed PT model containing 768 places and 384 transitions and 1536 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-384-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 384/384 transitions.
Applied a total of 0 rules in 116 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2023-03-08 19:27:20] [INFO ] Computed 385 place invariants in 68 ms
[2023-03-08 19:27:22] [INFO ] Implicit Places using invariants in 1599 ms returned [1, 7, 9, 17, 21, 26, 32, 42, 46, 48, 58, 63, 64, 71, 85, 86, 88, 98, 103, 107, 108, 133, 135, 137, 158, 162, 167, 174, 179, 185, 193, 198, 203, 220, 230, 245, 246, 254, 270, 276, 287, 293, 301, 331, 334, 340, 346, 347, 350, 353, 354, 357, 365, 383, 397, 403, 411, 412, 422, 426, 433, 448, 470, 475, 476, 496, 502, 504, 505, 507, 508, 522, 525, 538, 539, 545, 551, 576, 579, 580, 586, 600, 607, 619, 622, 625, 638, 643, 644, 647, 648, 662, 671, 674, 689, 693, 700, 708, 715, 718, 719, 723, 732, 740, 741, 743, 746, 747, 749, 758, 759, 760, 763]
Discarding 113 places :
Implicit Place search using SMT only with invariants took 1648 ms to find 113 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 655/768 places, 384/384 transitions.
Applied a total of 0 rules in 71 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1836 ms. Remains : 655/768 places, 384/384 transitions.
Support contains 60 out of 655 places after structural reductions.
[2023-03-08 19:27:22] [INFO ] Flatten gal took : 135 ms
[2023-03-08 19:27:22] [INFO ] Flatten gal took : 47 ms
[2023-03-08 19:27:22] [INFO ] Input system was already deterministic with 384 transitions.
Support contains 58 out of 655 places (down from 60) after GAL structural reductions.
Finished random walk after 1384 steps, including 0 resets, run visited all 27 properties in 201 ms. (steps per millisecond=6 )
FORMULA CircularTrains-PT-384-LTLFireability-07 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(!p0)) U !p1))))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 113 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2023-03-08 19:27:23] [INFO ] Computed 272 place invariants in 14 ms
[2023-03-08 19:27:24] [INFO ] Implicit Places using invariants in 642 ms returned [78, 155, 214, 252, 278, 315, 316, 345, 434, 467, 512, 522, 527]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 648 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 517/655 places, 259/384 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 516 transition count 258
Applied a total of 2 rules in 37 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2023-03-08 19:27:24] [INFO ] Computed 259 place invariants in 6 ms
[2023-03-08 19:27:24] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-08 19:27:24] [INFO ] Invariant cache hit.
[2023-03-08 19:27:25] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/655 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2257 ms. Remains : 516/655 places, 258/384 transitions.
Stuttering acceptance computed with spot in 299 ms :[p1, (AND p1 p0), p1]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s55 1) (GEQ s451 1)), p0:(AND (GEQ s149 1) (GEQ s239 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1903 ms.
Product exploration explored 100000 steps with 0 reset in 2029 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT 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 p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 571 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[p1, (AND p1 p0), p1]
Finished random walk after 960 steps, including 0 resets, run visited all 5 properties in 25 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT 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 p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 676 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[p1, (AND p1 p0), p1]
Stuttering acceptance computed with spot in 121 ms :[p1, (AND p1 p0), p1]
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 27 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 19:27:31] [INFO ] Invariant cache hit.
[2023-03-08 19:27:32] [INFO ] Implicit Places using invariants in 553 ms returned []
[2023-03-08 19:27:32] [INFO ] Invariant cache hit.
[2023-03-08 19:27:33] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
[2023-03-08 19:27:33] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-08 19:27:33] [INFO ] Invariant cache hit.
[2023-03-08 19:27:33] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1745 ms. Remains : 516/516 places, 258/258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 519 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[p1, (AND p1 p0), p1]
Finished random walk after 257 steps, including 0 resets, run visited all 5 properties in 10 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 640 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[p1, (AND p1 p0), p1]
Stuttering acceptance computed with spot in 120 ms :[p1, (AND p1 p0), p1]
Stuttering acceptance computed with spot in 120 ms :[p1, (AND p1 p0), p1]
Product exploration explored 100000 steps with 0 reset in 1692 ms.
Product exploration explored 100000 steps with 0 reset in 1950 ms.
Built C files in :
/tmp/ltsmin4220116995859700791
[2023-03-08 19:27:39] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2023-03-08 19:27:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:27:39] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2023-03-08 19:27:39] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:27:39] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2023-03-08 19:27:39] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:27:39] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4220116995859700791
Running compilation step : cd /tmp/ltsmin4220116995859700791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1138 ms.
Running link step : cd /tmp/ltsmin4220116995859700791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin4220116995859700791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12741331105398106354.hoa' '--buchi-type=spotba'
LTSmin run took 7246 ms.
FORMULA CircularTrains-PT-384-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-00 finished in 24179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 52 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2023-03-08 19:27:47] [INFO ] Computed 272 place invariants in 4 ms
[2023-03-08 19:27:48] [INFO ] Implicit Places using invariants in 543 ms returned [77, 150, 154, 214, 251, 277, 314, 344, 434, 461, 467, 512, 522]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 548 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 517/655 places, 259/384 transitions.
Drop transitions 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 517 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 516 transition count 258
Applied a total of 2 rules in 25 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2023-03-08 19:27:48] [INFO ] Computed 259 place invariants in 4 ms
[2023-03-08 19:27:48] [INFO ] Implicit Places using invariants in 613 ms returned []
[2023-03-08 19:27:48] [INFO ] Invariant cache hit.
[2023-03-08 19:27:49] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/655 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2073 ms. Remains : 516/655 places, 258/384 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s363 1) (LT s513 1)) (OR (LT s207 1) (LT s307 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1653 ms.
Product exploration explored 100000 steps with 0 reset in 1915 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 201 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 50 ms :[(NOT p0)]
Finished random walk after 93 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=23 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 149 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 60 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 18 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 19:27:53] [INFO ] Invariant cache hit.
[2023-03-08 19:27:54] [INFO ] Implicit Places using invariants in 656 ms returned []
[2023-03-08 19:27:54] [INFO ] Invariant cache hit.
[2023-03-08 19:27:55] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2023-03-08 19:27:55] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 19:27:55] [INFO ] Invariant cache hit.
[2023-03-08 19:27:55] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2070 ms. Remains : 516/516 places, 258/258 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 125 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)]
Finished random walk after 63 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=21 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 143 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1629 ms.
Product exploration explored 100000 steps with 0 reset in 1853 ms.
Built C files in :
/tmp/ltsmin8440978496492492360
[2023-03-08 19:28:00] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2023-03-08 19:28:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:28:00] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2023-03-08 19:28:00] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:28:00] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2023-03-08 19:28:00] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:28:00] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8440978496492492360
Running compilation step : cd /tmp/ltsmin8440978496492492360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 885 ms.
Running link step : cd /tmp/ltsmin8440978496492492360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8440978496492492360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6155488637833097683.hoa' '--buchi-type=spotba'
LTSmin run took 3476 ms.
FORMULA CircularTrains-PT-384-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-01 finished in 16897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2023-03-08 19:28:04] [INFO ] Computed 272 place invariants in 10 ms
[2023-03-08 19:28:05] [INFO ] Implicit Places using invariants in 703 ms returned [88, 182, 187, 260, 302, 336, 386, 387, 420, 542, 574, 632, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 707 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 735 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s247 1) (LT s634 1)), p2:(AND (GEQ s269 1) (GEQ s549 1)), p1:(AND (GEQ s372 1) (GEQ s572 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 770 reset in 2310 ms.
Product exploration explored 100000 steps with 765 reset in 2248 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 943 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 1752 steps, including 0 resets, run visited all 8 properties in 93 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 912 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2023-03-08 19:28:12] [INFO ] Computed 259 place invariants in 8 ms
[2023-03-08 19:28:12] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-08 19:28:12] [INFO ] Invariant cache hit.
[2023-03-08 19:28:13] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
[2023-03-08 19:28:13] [INFO ] Invariant cache hit.
[2023-03-08 19:28:14] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1996 ms. Remains : 642/642 places, 384/384 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 (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 750 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 1945 steps, including 0 resets, run visited all 8 properties in 56 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 984 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 808 reset in 2206 ms.
Product exploration explored 100000 steps with 779 reset in 2372 ms.
Built C files in :
/tmp/ltsmin7776049735228321045
[2023-03-08 19:28:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7776049735228321045
Running compilation step : cd /tmp/ltsmin7776049735228321045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1067 ms.
Running link step : cd /tmp/ltsmin7776049735228321045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7776049735228321045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2970871544448428617.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 28 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 19:28:36] [INFO ] Invariant cache hit.
[2023-03-08 19:28:37] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-03-08 19:28:37] [INFO ] Invariant cache hit.
[2023-03-08 19:28:38] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
[2023-03-08 19:28:38] [INFO ] Invariant cache hit.
[2023-03-08 19:28:38] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2139 ms. Remains : 642/642 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin11298027490138854465
[2023-03-08 19:28:39] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11298027490138854465
Running compilation step : cd /tmp/ltsmin11298027490138854465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1038 ms.
Running link step : cd /tmp/ltsmin11298027490138854465;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11298027490138854465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15891158461017634369.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 19:28:54] [INFO ] Flatten gal took : 53 ms
[2023-03-08 19:28:54] [INFO ] Flatten gal took : 45 ms
[2023-03-08 19:28:54] [INFO ] Time to serialize gal into /tmp/LTL5410538050181266193.gal : 17 ms
[2023-03-08 19:28:54] [INFO ] Time to serialize properties into /tmp/LTL4998930219300866362.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5410538050181266193.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6539404259999383324.hoa' '-atoms' '/tmp/LTL4998930219300866362.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4998930219300866362.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6539404259999383324.hoa
Detected timeout of ITS tools.
[2023-03-08 19:29:09] [INFO ] Flatten gal took : 57 ms
[2023-03-08 19:29:09] [INFO ] Flatten gal took : 44 ms
[2023-03-08 19:29:09] [INFO ] Time to serialize gal into /tmp/LTL11904258619406931212.gal : 30 ms
[2023-03-08 19:29:09] [INFO ] Time to serialize properties into /tmp/LTL15277608074242043951.ltl : 4 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11904258619406931212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15277608074242043951.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((Section_34<1)||(F35<1))"))||(X((X(!("((Section_115>=1)&&(F116>=1))")))U((X(G(!("((Section_115>=1)&&(F116>=1))"))))||((!("((...233
Formula 0 simplified : G(F!"((Section_34<1)||(F35<1))" & X(X"((Section_115>=1)&&(F116>=1))" R (XF"((Section_115>=1)&&(F116>=1))" & ("((F112>=1)&&(Section_1...202
Detected timeout of ITS tools.
[2023-03-08 19:29:24] [INFO ] Flatten gal took : 67 ms
[2023-03-08 19:29:24] [INFO ] Applying decomposition
[2023-03-08 19:29:24] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11215502028213055472.txt' '-o' '/tmp/graph11215502028213055472.bin' '-w' '/tmp/graph11215502028213055472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11215502028213055472.bin' '-l' '-1' '-v' '-w' '/tmp/graph11215502028213055472.weights' '-q' '0' '-e' '0.001'
[2023-03-08 19:29:25] [INFO ] Decomposing Gal with order
[2023-03-08 19:29:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 19:29:25] [INFO ] Flatten gal took : 127 ms
[2023-03-08 19:29:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-08 19:29:25] [INFO ] Time to serialize gal into /tmp/LTL14846900177693482370.gal : 11 ms
[2023-03-08 19:29:25] [INFO ] Time to serialize properties into /tmp/LTL7890609142340062163.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14846900177693482370.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7890609142340062163.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i9.i1.u57.Section_34<1)||(i9.i1.u38.F35<1))"))||(X((X(!("((i23.u31.Section_115>=1)&&(i23.u93.F116>=1))")))U((X(G(!("((i23.u...317
Formula 0 simplified : G(F!"((i9.i1.u57.Section_34<1)||(i9.i1.u38.F35<1))" & X(X"((i23.u31.Section_115>=1)&&(i23.u93.F116>=1))" R (XF"((i23.u31.Section_115...286
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7207071218898276951
[2023-03-08 19:29:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7207071218898276951
Running compilation step : cd /tmp/ltsmin7207071218898276951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1021 ms.
Running link step : cd /tmp/ltsmin7207071218898276951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7207071218898276951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X((X(!(LTLAPp1==true)) U (X([](!(LTLAPp1==true)))||(!(LTLAPp2==true)&&X(!(LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 111137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 56 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2023-03-08 19:29:55] [INFO ] Computed 272 place invariants in 3 ms
[2023-03-08 19:29:56] [INFO ] Implicit Places using invariants in 880 ms returned [77, 151, 155, 214, 277, 314, 315, 434, 461, 467, 512, 522, 527]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 883 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 517/655 places, 259/384 transitions.
Drop transitions 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 517 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 516 transition count 258
Applied a total of 2 rules in 20 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2023-03-08 19:29:56] [INFO ] Computed 259 place invariants in 4 ms
[2023-03-08 19:29:57] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-08 19:29:57] [INFO ] Invariant cache hit.
[2023-03-08 19:29:58] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/655 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2555 ms. Remains : 516/655 places, 258/384 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s316 1) (GEQ s337 1)), p0:(AND (GEQ s111 1) (GEQ s246 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1040 reset in 2093 ms.
Product exploration explored 100000 steps with 1068 reset in 2301 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)), true]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 474 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 109 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 97 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 462 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 111 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2023-03-08 19:30:04] [INFO ] Invariant cache hit.
[2023-03-08 19:30:04] [INFO ] [Real]Absence check using 256 positive place invariants in 172 ms returned sat
[2023-03-08 19:30:04] [INFO ] [Real]Absence check using 256 positive and 3 generalized place invariants in 48 ms returned sat
[2023-03-08 19:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:30:06] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2023-03-08 19:30:06] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-08 19:30:08] [INFO ] Added : 127 causal constraints over 26 iterations in 2357 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 15 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 19:30:08] [INFO ] Invariant cache hit.
[2023-03-08 19:30:09] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-08 19:30:09] [INFO ] Invariant cache hit.
[2023-03-08 19:30:10] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
[2023-03-08 19:30:10] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 19:30:10] [INFO ] Invariant cache hit.
[2023-03-08 19:30:10] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2005 ms. Remains : 516/516 places, 258/258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 659 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 114 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 52 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 473 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 111 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2023-03-08 19:30:12] [INFO ] Invariant cache hit.
[2023-03-08 19:30:12] [INFO ] [Real]Absence check using 256 positive place invariants in 133 ms returned sat
[2023-03-08 19:30:12] [INFO ] [Real]Absence check using 256 positive and 3 generalized place invariants in 44 ms returned sat
[2023-03-08 19:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:30:13] [INFO ] [Real]Absence check using state equation in 1289 ms returned sat
[2023-03-08 19:30:14] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 73 ms.
[2023-03-08 19:30:16] [INFO ] Added : 127 causal constraints over 26 iterations in 2386 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1010 reset in 2108 ms.
Product exploration explored 100000 steps with 996 reset in 2296 ms.
Built C files in :
/tmp/ltsmin16569754693473616823
[2023-03-08 19:30:20] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2023-03-08 19:30:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:30:20] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2023-03-08 19:30:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:30:20] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2023-03-08 19:30:20] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:30:20] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16569754693473616823
Running compilation step : cd /tmp/ltsmin16569754693473616823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 890 ms.
Running link step : cd /tmp/ltsmin16569754693473616823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16569754693473616823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14718932798965141815.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 16 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 19:30:36] [INFO ] Invariant cache hit.
[2023-03-08 19:30:36] [INFO ] Implicit Places using invariants in 719 ms returned []
[2023-03-08 19:30:36] [INFO ] Invariant cache hit.
[2023-03-08 19:30:37] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2023-03-08 19:30:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 19:30:37] [INFO ] Invariant cache hit.
[2023-03-08 19:30:38] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1991 ms. Remains : 516/516 places, 258/258 transitions.
Built C files in :
/tmp/ltsmin14804752122619090450
[2023-03-08 19:30:38] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2023-03-08 19:30:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:30:38] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2023-03-08 19:30:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:30:38] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2023-03-08 19:30:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:30:38] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14804752122619090450
Running compilation step : cd /tmp/ltsmin14804752122619090450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 889 ms.
Running link step : cd /tmp/ltsmin14804752122619090450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14804752122619090450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9677181667835700070.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 19:30:53] [INFO ] Flatten gal took : 20 ms
[2023-03-08 19:30:53] [INFO ] Flatten gal took : 30 ms
[2023-03-08 19:30:53] [INFO ] Time to serialize gal into /tmp/LTL5643672695939151845.gal : 5 ms
[2023-03-08 19:30:53] [INFO ] Time to serialize properties into /tmp/LTL17998177955997440463.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5643672695939151845.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5697664595904544098.hoa' '-atoms' '/tmp/LTL17998177955997440463.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17998177955997440463.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5697664595904544098.hoa
Detected timeout of ITS tools.
[2023-03-08 19:31:08] [INFO ] Flatten gal took : 17 ms
[2023-03-08 19:31:08] [INFO ] Flatten gal took : 16 ms
[2023-03-08 19:31:08] [INFO ] Time to serialize gal into /tmp/LTL10022140802338369279.gal : 3 ms
[2023-03-08 19:31:08] [INFO ] Time to serialize properties into /tmp/LTL10938596086868492957.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10022140802338369279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10938596086868492957.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(F("((Section_355>=1)&&(F356>=1))")))U("((Section_325>=1)&&(F326>=1))")))
Formula 0 simplified : FG!"((Section_355>=1)&&(F356>=1))" R !"((Section_325>=1)&&(F326>=1))"
Detected timeout of ITS tools.
[2023-03-08 19:31:23] [INFO ] Flatten gal took : 17 ms
[2023-03-08 19:31:23] [INFO ] Applying decomposition
[2023-03-08 19:31:23] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph621660632278147517.txt' '-o' '/tmp/graph621660632278147517.bin' '-w' '/tmp/graph621660632278147517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph621660632278147517.bin' '-l' '-1' '-v' '-w' '/tmp/graph621660632278147517.weights' '-q' '0' '-e' '0.001'
[2023-03-08 19:31:23] [INFO ] Decomposing Gal with order
[2023-03-08 19:31:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 19:31:23] [INFO ] Flatten gal took : 68 ms
[2023-03-08 19:31:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-08 19:31:23] [INFO ] Time to serialize gal into /tmp/LTL15966802964806384005.gal : 8 ms
[2023-03-08 19:31:23] [INFO ] Time to serialize properties into /tmp/LTL17556475829741410996.ltl : 15 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15966802964806384005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17556475829741410996.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i4.u55.Section_355>=1)&&(i4.u55.F356>=1))")))U("((i13.i1.i1.u159.Section_325>=1)&&(i13.i1.i1.u211.F326>=1))")))
Formula 0 simplified : FG!"((i4.u55.Section_355>=1)&&(i4.u55.F356>=1))" R !"((i13.i1.i1.u159.Section_325>=1)&&(i13.i1.i1.u211.F326>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11623611377283222575
[2023-03-08 19:31:38] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11623611377283222575
Running compilation step : cd /tmp/ltsmin11623611377283222575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 733 ms.
Running link step : cd /tmp/ltsmin11623611377283222575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11623611377283222575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true))) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-05 finished in 118347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 8 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 655 transition count 289
Reduce places removed 95 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 191 place count 560 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 559 transition count 288
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 192 place count 559 transition count 272
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 98 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2023-03-08 19:31:54] [INFO ] Computed 272 place invariants in 4 ms
[2023-03-08 19:31:54] [INFO ] Implicit Places using invariants in 697 ms returned [77, 154, 213, 251, 277, 314, 315, 344, 433, 460, 466, 511, 521, 526]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 710 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions 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 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 19 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2023-03-08 19:31:54] [INFO ] Computed 258 place invariants in 3 ms
[2023-03-08 19:31:55] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-08 19:31:55] [INFO ] Invariant cache hit.
[2023-03-08 19:31:55] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2003 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s31 1) (GEQ s450 1) (GEQ s289 1) (GEQ s402 1)), p0:(AND (GEQ s12 1) (GEQ s100 1) (GEQ s148 1) (GEQ s238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 246 reset in 1856 ms.
Product exploration explored 100000 steps with 263 reset in 2083 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1386 steps, including 0 resets, run visited all 2 properties in 39 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 19:32:00] [INFO ] Invariant cache hit.
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-384-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-384-LTLFireability-06 finished in 7431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 655 transition count 286
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 197 place count 557 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 198 place count 556 transition count 272
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 41 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2023-03-08 19:32:01] [INFO ] Computed 272 place invariants in 5 ms
[2023-03-08 19:32:02] [INFO ] Implicit Places using invariants in 707 ms returned [151, 155, 214, 251, 277, 314, 315, 344, 433, 460, 466, 511, 521, 526]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 722 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions 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 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 18 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2023-03-08 19:32:02] [INFO ] Computed 258 place invariants in 3 ms
[2023-03-08 19:32:02] [INFO ] Implicit Places using invariants in 520 ms returned []
[2023-03-08 19:32:02] [INFO ] Invariant cache hit.
[2023-03-08 19:32:03] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2080 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s82 1) (GEQ s252 1) (GEQ s77 1) (GEQ s148 1))) (NOT (AND (GEQ s77 1) (GEQ s148 1)))), p0:(AND (GEQ s77 1) (GEQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 563 reset in 2077 ms.
Product exploration explored 100000 steps with 560 reset in 2261 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:32:08] [INFO ] Invariant cache hit.
[2023-03-08 19:32:08] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 289 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2023-03-08 19:32:09] [INFO ] Invariant cache hit.
[2023-03-08 19:32:09] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-08 19:32:09] [INFO ] Invariant cache hit.
[2023-03-08 19:32:10] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2023-03-08 19:32:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:32:10] [INFO ] Invariant cache hit.
[2023-03-08 19:32:10] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1653 ms. Remains : 514/514 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 132 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 p1), (NOT p1)]
Finished random walk after 77 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=25 )
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 153 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 552 reset in 2032 ms.
Product exploration explored 100000 steps with 552 reset in 2240 ms.
Built C files in :
/tmp/ltsmin3998202293082791134
[2023-03-08 19:32:15] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2023-03-08 19:32:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:32:15] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2023-03-08 19:32:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:32:15] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2023-03-08 19:32:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:32:15] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3998202293082791134
Running compilation step : cd /tmp/ltsmin3998202293082791134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 886 ms.
Running link step : cd /tmp/ltsmin3998202293082791134;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3998202293082791134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17103814238506819231.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2023-03-08 19:32:30] [INFO ] Invariant cache hit.
[2023-03-08 19:32:31] [INFO ] Implicit Places using invariants in 551 ms returned []
[2023-03-08 19:32:31] [INFO ] Invariant cache hit.
[2023-03-08 19:32:32] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2023-03-08 19:32:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:32:32] [INFO ] Invariant cache hit.
[2023-03-08 19:32:32] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1665 ms. Remains : 514/514 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin4382812434892425275
[2023-03-08 19:32:32] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2023-03-08 19:32:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:32:32] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2023-03-08 19:32:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:32:32] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2023-03-08 19:32:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:32:32] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4382812434892425275
Running compilation step : cd /tmp/ltsmin4382812434892425275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 866 ms.
Running link step : cd /tmp/ltsmin4382812434892425275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4382812434892425275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14536299680876394706.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 19:32:47] [INFO ] Flatten gal took : 14 ms
[2023-03-08 19:32:47] [INFO ] Flatten gal took : 12 ms
[2023-03-08 19:32:47] [INFO ] Time to serialize gal into /tmp/LTL10932964437581121076.gal : 2 ms
[2023-03-08 19:32:47] [INFO ] Time to serialize properties into /tmp/LTL3413185590591544247.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10932964437581121076.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6157340455302640584.hoa' '-atoms' '/tmp/LTL3413185590591544247.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3413185590591544247.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6157340455302640584.hoa
Detected timeout of ITS tools.
[2023-03-08 19:33:02] [INFO ] Flatten gal took : 14 ms
[2023-03-08 19:33:02] [INFO ] Flatten gal took : 14 ms
[2023-03-08 19:33:02] [INFO ] Time to serialize gal into /tmp/LTL8956648613494679558.gal : 2 ms
[2023-03-08 19:33:02] [INFO ] Time to serialize properties into /tmp/LTL9391977597981221867.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8956648613494679558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9391977597981221867.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((F83>=1)&&(Section_82>=1))"))U((G(!("((F83>=1)&&(Section_82>=1))")))||("((!(((F94>=1)&&(Section_93>=1))&&((F83>=1)&&(Secti...207
Formula 0 simplified : FG("((F83>=1)&&(Section_82>=1))" M !"((!(((F94>=1)&&(Section_93>=1))&&((F83>=1)&&(Section_82>=1))))&&(!((F83>=1)&&(Section_82>=1))))...157
Detected timeout of ITS tools.
[2023-03-08 19:33:17] [INFO ] Flatten gal took : 12 ms
[2023-03-08 19:33:17] [INFO ] Applying decomposition
[2023-03-08 19:33:17] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10804196702959177791.txt' '-o' '/tmp/graph10804196702959177791.bin' '-w' '/tmp/graph10804196702959177791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10804196702959177791.bin' '-l' '-1' '-v' '-w' '/tmp/graph10804196702959177791.weights' '-q' '0' '-e' '0.001'
[2023-03-08 19:33:17] [INFO ] Decomposing Gal with order
[2023-03-08 19:33:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 19:33:18] [INFO ] Flatten gal took : 64 ms
[2023-03-08 19:33:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-08 19:33:18] [INFO ] Time to serialize gal into /tmp/LTL1056799590310936283.gal : 5 ms
[2023-03-08 19:33:18] [INFO ] Time to serialize properties into /tmp/LTL375451686540697998.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1056799590310936283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL375451686540697998.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i17.u68.F83>=1)&&(i17.u68.Section_82>=1))"))U((G(!("((i17.u68.F83>=1)&&(i17.u68.Section_82>=1))")))||("((!(((i6.u36.F94>=...286
Formula 0 simplified : FG("((i17.u68.F83>=1)&&(i17.u68.Section_82>=1))" M !"((!(((i6.u36.F94>=1)&&(i6.u128.Section_93>=1))&&((i17.u68.F83>=1)&&(i17.u68.Sec...220
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13368665665493926342
[2023-03-08 19:33:33] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13368665665493926342
Running compilation step : cd /tmp/ltsmin13368665665493926342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 747 ms.
Running link step : cd /tmp/ltsmin13368665665493926342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13368665665493926342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-08 finished in 106848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 655 transition count 287
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 558 transition count 287
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 194 place count 558 transition count 271
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 226 place count 542 transition count 271
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 254 place count 528 transition count 257
Applied a total of 254 rules in 38 ms. Remains 528 /655 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 528 cols
[2023-03-08 19:33:48] [INFO ] Computed 272 place invariants in 3 ms
[2023-03-08 19:33:48] [INFO ] Implicit Places using invariants in 702 ms returned [77, 150, 154, 213, 250, 276, 313, 314, 343, 432, 459, 465, 510, 520, 525]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 703 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/655 places, 257/384 transitions.
Drop transitions 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 513 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 256
Applied a total of 2 rules in 15 ms. Remains 512 /513 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 512 cols
[2023-03-08 19:33:49] [INFO ] Computed 257 place invariants in 3 ms
[2023-03-08 19:33:49] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-08 19:33:49] [INFO ] Invariant cache hit.
[2023-03-08 19:33:50] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/655 places, 256/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2066 ms. Remains : 512/655 places, 256/384 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s131 1) (GEQ s477 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 722 reset in 2049 ms.
Product exploration explored 100000 steps with 731 reset in 2232 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 157 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=31 )
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 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-08 19:33:55] [INFO ] Invariant cache hit.
[2023-03-08 19:33:55] [INFO ] [Real]Absence check using 255 positive place invariants in 147 ms returned sat
[2023-03-08 19:33:55] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-08 19:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:33:56] [INFO ] [Real]Absence check using state equation in 1283 ms returned sat
[2023-03-08 19:33:57] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-08 19:33:59] [INFO ] Added : 126 causal constraints over 26 iterations in 2351 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 20 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 19:33:59] [INFO ] Invariant cache hit.
[2023-03-08 19:33:59] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-08 19:33:59] [INFO ] Invariant cache hit.
[2023-03-08 19:34:00] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2023-03-08 19:34:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:34:00] [INFO ] Invariant cache hit.
[2023-03-08 19:34:01] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1674 ms. Remains : 512/512 places, 256/256 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 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 131 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=32 )
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 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-08 19:34:01] [INFO ] Invariant cache hit.
[2023-03-08 19:34:02] [INFO ] [Real]Absence check using 255 positive place invariants in 133 ms returned sat
[2023-03-08 19:34:02] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-08 19:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:03] [INFO ] [Real]Absence check using state equation in 1249 ms returned sat
[2023-03-08 19:34:03] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 39 ms.
[2023-03-08 19:34:05] [INFO ] Added : 126 causal constraints over 26 iterations in 2629 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 751 reset in 2082 ms.
Product exploration explored 100000 steps with 739 reset in 2230 ms.
Built C files in :
/tmp/ltsmin17925979419879661816
[2023-03-08 19:34:10] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2023-03-08 19:34:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:34:10] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2023-03-08 19:34:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:34:10] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2023-03-08 19:34:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:34:10] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17925979419879661816
Running compilation step : cd /tmp/ltsmin17925979419879661816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 896 ms.
Running link step : cd /tmp/ltsmin17925979419879661816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17925979419879661816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6743712016737768472.hoa' '--buchi-type=spotba'
LTSmin run took 3514 ms.
FORMULA CircularTrains-PT-384-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-09 finished in 26638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2023-03-08 19:34:14] [INFO ] Computed 272 place invariants in 5 ms
[2023-03-08 19:34:15] [INFO ] Implicit Places using invariants in 709 ms returned [88, 182, 187, 260, 302, 336, 386, 387, 420, 542, 574, 583, 646, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 713 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/655 places, 384/384 transitions.
Applied a total of 0 rules in 15 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 741 ms. Remains : 641/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s95 1) (GEQ s620 1)), p0:(AND (GEQ s355 1) (GEQ s504 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 124 steps with 3 reset in 4 ms.
FORMULA CircularTrains-PT-384-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-10 finished in 876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 655 transition count 288
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 559 transition count 288
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 192 place count 559 transition count 271
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 226 place count 542 transition count 271
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 254 place count 528 transition count 257
Applied a total of 254 rules in 31 ms. Remains 528 /655 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 528 cols
[2023-03-08 19:34:15] [INFO ] Computed 272 place invariants in 4 ms
[2023-03-08 19:34:16] [INFO ] Implicit Places using invariants in 726 ms returned [77, 150, 154, 213, 250, 276, 313, 314, 343, 432, 459, 465, 510, 520, 525]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 730 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/655 places, 257/384 transitions.
Drop transitions 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 513 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 256
Applied a total of 2 rules in 22 ms. Remains 512 /513 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 512 cols
[2023-03-08 19:34:16] [INFO ] Computed 257 place invariants in 3 ms
[2023-03-08 19:34:17] [INFO ] Implicit Places using invariants in 729 ms returned []
[2023-03-08 19:34:17] [INFO ] Invariant cache hit.
[2023-03-08 19:34:18] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/655 places, 256/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2645 ms. Remains : 512/655 places, 256/384 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s331 1) (GEQ s416 1) (GEQ s22 1) (GEQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 270 reset in 2087 ms.
Product exploration explored 100000 steps with 258 reset in 1948 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 based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 116 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-08 19:34:23] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-384-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-384-LTLFireability-11 finished in 7720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(F(p2)&&F(p0)&&p1)))))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 20 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2023-03-08 19:34:23] [INFO ] Computed 272 place invariants in 7 ms
[2023-03-08 19:34:24] [INFO ] Implicit Places using invariants in 889 ms returned [88, 182, 187, 302, 336, 387, 420, 542, 574, 583, 632, 646, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 890 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 923 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (GEQ s168 1) (GEQ s381 1)), p0:(AND (GEQ s168 1) (GEQ s381 1)), p2:(AND (GEQ s257 1) (GEQ s418 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 454 reset in 2095 ms.
Product exploration explored 100000 steps with 440 reset in 2043 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) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 515 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 384 rows 642 cols
[2023-03-08 19:34:30] [INFO ] Computed 259 place invariants in 5 ms
[2023-03-08 19:34:30] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p2) p0)), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 1020 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-08 19:34:31] [INFO ] Invariant cache hit.
[2023-03-08 19:34:32] [INFO ] [Real]Absence check using 255 positive place invariants in 146 ms returned sat
[2023-03-08 19:34:32] [INFO ] [Real]Absence check using 255 positive and 4 generalized place invariants in 57 ms returned sat
[2023-03-08 19:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:34] [INFO ] [Real]Absence check using state equation in 2515 ms returned sat
[2023-03-08 19:34:35] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 38 ms.
[2023-03-08 19:34:46] [INFO ] Added : 240 causal constraints over 48 iterations in 11701 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 19 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 19:34:46] [INFO ] Invariant cache hit.
[2023-03-08 19:34:47] [INFO ] Implicit Places using invariants in 857 ms returned []
[2023-03-08 19:34:47] [INFO ] Invariant cache hit.
[2023-03-08 19:34:48] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2023-03-08 19:34:48] [INFO ] Invariant cache hit.
[2023-03-08 19:34:48] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2182 ms. Remains : 642/642 places, 384/384 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))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 249 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 1 factoid took 486 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-08 19:34:50] [INFO ] Invariant cache hit.
[2023-03-08 19:34:51] [INFO ] [Real]Absence check using 255 positive place invariants in 214 ms returned sat
[2023-03-08 19:34:51] [INFO ] [Real]Absence check using 255 positive and 4 generalized place invariants in 87 ms returned sat
[2023-03-08 19:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:53] [INFO ] [Real]Absence check using state equation in 2498 ms returned sat
[2023-03-08 19:34:53] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-08 19:35:05] [INFO ] Deduced a trap composed of 3 places in 422 ms of which 7 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 19:35:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 434 reset in 1873 ms.
Product exploration explored 100000 steps with 429 reset in 2410 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 642 transition count 384
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 126 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 642 transition count 384
Deduced a syphon composed of 126 places in 0 ms
Applied a total of 126 rules in 93 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 19:35:10] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 384 rows 642 cols
[2023-03-08 19:35:10] [INFO ] Computed 259 place invariants in 4 ms
[2023-03-08 19:35:11] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 642/642 places, 384/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 666 ms. Remains : 642/642 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin1185880385137396002
[2023-03-08 19:35:11] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1185880385137396002
Running compilation step : cd /tmp/ltsmin1185880385137396002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1103 ms.
Running link step : cd /tmp/ltsmin1185880385137396002;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1185880385137396002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11511285666174706540.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2023-03-08 19:35:26] [INFO ] Computed 259 place invariants in 4 ms
[2023-03-08 19:35:26] [INFO ] Implicit Places using invariants in 731 ms returned []
[2023-03-08 19:35:26] [INFO ] Invariant cache hit.
[2023-03-08 19:35:27] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2023-03-08 19:35:27] [INFO ] Invariant cache hit.
[2023-03-08 19:35:28] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2206 ms. Remains : 642/642 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin11162470963497669868
[2023-03-08 19:35:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11162470963497669868
Running compilation step : cd /tmp/ltsmin11162470963497669868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1304 ms.
Running link step : cd /tmp/ltsmin11162470963497669868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11162470963497669868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6875937567655313194.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 19:35:43] [INFO ] Flatten gal took : 27 ms
[2023-03-08 19:35:43] [INFO ] Flatten gal took : 13 ms
[2023-03-08 19:35:43] [INFO ] Time to serialize gal into /tmp/LTL16780536921305094091.gal : 3 ms
[2023-03-08 19:35:43] [INFO ] Time to serialize properties into /tmp/LTL156947589775826995.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16780536921305094091.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10653077249773634347.hoa' '-atoms' '/tmp/LTL156947589775826995.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL156947589775826995.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10653077249773634347.hoa
Detected timeout of ITS tools.
[2023-03-08 19:35:58] [INFO ] Flatten gal took : 22 ms
[2023-03-08 19:35:58] [INFO ] Flatten gal took : 21 ms
[2023-03-08 19:35:58] [INFO ] Time to serialize gal into /tmp/LTL10505028891818206110.gal : 4 ms
[2023-03-08 19:35:58] [INFO ] Time to serialize properties into /tmp/LTL9347910576684966030.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10505028891818206110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9347910576684966030.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((Section_28>=1)&&(F29>=1))"))||(("((Section_28>=1)&&(F29>=1))")&&((F("((F158>=1)&&(Section_157>=1))"))&&(F("((Section_28>=...177
Formula 0 simplified : XG(F!"((Section_28>=1)&&(F29>=1))" & (!"((Section_28>=1)&&(F29>=1))" | G!"((F158>=1)&&(Section_157>=1))"))
Detected timeout of ITS tools.
[2023-03-08 19:36:13] [INFO ] Flatten gal took : 14 ms
[2023-03-08 19:36:13] [INFO ] Applying decomposition
[2023-03-08 19:36:13] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11533874001585100141.txt' '-o' '/tmp/graph11533874001585100141.bin' '-w' '/tmp/graph11533874001585100141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11533874001585100141.bin' '-l' '-1' '-v' '-w' '/tmp/graph11533874001585100141.weights' '-q' '0' '-e' '0.001'
[2023-03-08 19:36:13] [INFO ] Decomposing Gal with order
[2023-03-08 19:36:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 19:36:13] [INFO ] Flatten gal took : 23 ms
[2023-03-08 19:36:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-08 19:36:13] [INFO ] Time to serialize gal into /tmp/LTL14512835885609379991.gal : 5 ms
[2023-03-08 19:36:13] [INFO ] Time to serialize properties into /tmp/LTL8132878789459226822.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14512835885609379991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8132878789459226822.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((i5.i0.u21.Section_28>=1)&&(i5.i0.u14.F29>=1))"))||(("((i5.i0.u21.Section_28>=1)&&(i5.i0.u14.F29>=1))")&&((F("((i20.i0.u87...259
Formula 0 simplified : XG(F!"((i5.i0.u21.Section_28>=1)&&(i5.i0.u14.F29>=1))" & (!"((i5.i0.u21.Section_28>=1)&&(i5.i0.u14.F29>=1))" | G!"((i20.i0.u87.F158>...191
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2248293522274207371
[2023-03-08 19:36:28] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2248293522274207371
Running compilation step : cd /tmp/ltsmin2248293522274207371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1085 ms.
Running link step : cd /tmp/ltsmin2248293522274207371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2248293522274207371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))||(<>((LTLAPp2==true))&&<>((LTLAPp0==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-12 finished in 140548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(!p0&&F(!p1))))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2023-03-08 19:36:44] [INFO ] Computed 272 place invariants in 4 ms
[2023-03-08 19:36:44] [INFO ] Implicit Places using invariants in 679 ms returned [88, 182, 260, 302, 336, 386, 387, 420, 542, 574, 583, 632, 646, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 681 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/655 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 708 ms. Remains : 641/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, p1, p0, (AND p1 p0), p0, p0]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s185 1) (GEQ s352 1)), p0:(AND (GEQ s193 1) (GEQ s368 1) (GEQ s436 1) (GEQ s506 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20404 reset in 2433 ms.
Product exploration explored 100000 steps with 20146 reset in 2380 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 1227 steps, including 0 resets, run visited all 3 properties in 24 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p1), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 261 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 242 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Applied a total of 0 rules in 15 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 641 cols
[2023-03-08 19:36:50] [INFO ] Computed 258 place invariants in 7 ms
[2023-03-08 19:36:51] [INFO ] Implicit Places using invariants in 671 ms returned []
[2023-03-08 19:36:51] [INFO ] Invariant cache hit.
[2023-03-08 19:36:52] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
[2023-03-08 19:36:52] [INFO ] Invariant cache hit.
[2023-03-08 19:36:53] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2488 ms. Remains : 641/641 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 450 steps, including 0 resets, run visited all 3 properties in 18 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 242 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 271 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 21706 reset in 2448 ms.
Product exploration explored 100000 steps with 21831 reset in 2564 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 182 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 641 transition count 384
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 122 place count 641 transition count 384
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 641 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 127 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 641 transition count 384
Deduced a syphon composed of 127 places in 0 ms
Applied a total of 127 rules in 54 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 19:37:00] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 384 rows 641 cols
[2023-03-08 19:37:00] [INFO ] Computed 258 place invariants in 4 ms
[2023-03-08 19:37:00] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 641/641 places, 384/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 755 ms. Remains : 641/641 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin5738909859145264668
[2023-03-08 19:37:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5738909859145264668
Running compilation step : cd /tmp/ltsmin5738909859145264668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1270 ms.
Running link step : cd /tmp/ltsmin5738909859145264668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5738909859145264668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9066128521097969144.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 641 cols
[2023-03-08 19:37:16] [INFO ] Computed 258 place invariants in 6 ms
[2023-03-08 19:37:16] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-03-08 19:37:16] [INFO ] Invariant cache hit.
[2023-03-08 19:37:17] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1642 ms to find 0 implicit places.
[2023-03-08 19:37:17] [INFO ] Invariant cache hit.
[2023-03-08 19:37:18] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2114 ms. Remains : 641/641 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin109715091188643979
[2023-03-08 19:37:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin109715091188643979
Running compilation step : cd /tmp/ltsmin109715091188643979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1106 ms.
Running link step : cd /tmp/ltsmin109715091188643979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin109715091188643979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13010541644939158301.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 19:37:33] [INFO ] Flatten gal took : 12 ms
[2023-03-08 19:37:33] [INFO ] Flatten gal took : 13 ms
[2023-03-08 19:37:33] [INFO ] Time to serialize gal into /tmp/LTL1239211316899394756.gal : 2 ms
[2023-03-08 19:37:33] [INFO ] Time to serialize properties into /tmp/LTL14737204413317526110.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1239211316899394756.gal' '-t' 'CGAL' '-hoa' '/tmp/aut340725806439005207.hoa' '-atoms' '/tmp/LTL14737204413317526110.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL14737204413317526110.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut340725806439005207.hoa
Detected timeout of ITS tools.
[2023-03-08 19:37:48] [INFO ] Flatten gal took : 12 ms
[2023-03-08 19:37:48] [INFO ] Flatten gal took : 12 ms
[2023-03-08 19:37:48] [INFO ] Time to serialize gal into /tmp/LTL6014991215034311288.gal : 3 ms
[2023-03-08 19:37:48] [INFO ] Time to serialize properties into /tmp/LTL10211236586714393048.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6014991215034311288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10211236586714393048.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(((F309<1)||(Section_308<1))||((F75<1)||(Section_74<1)))"))||((F("((F152<1)||(Section_151<1))"))&&("(((F309<1)||(Section_30...195
Formula 0 simplified : XX(F!"(((F309<1)||(Section_308<1))||((F75<1)||(Section_74<1)))" & (!"(((F309<1)||(Section_308<1))||((F75<1)||(Section_74<1)))" | G!"...185
Detected timeout of ITS tools.
[2023-03-08 19:38:03] [INFO ] Flatten gal took : 14 ms
[2023-03-08 19:38:03] [INFO ] Applying decomposition
[2023-03-08 19:38:03] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9905510568738042151.txt' '-o' '/tmp/graph9905510568738042151.bin' '-w' '/tmp/graph9905510568738042151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9905510568738042151.bin' '-l' '-1' '-v' '-w' '/tmp/graph9905510568738042151.weights' '-q' '0' '-e' '0.001'
[2023-03-08 19:38:03] [INFO ] Decomposing Gal with order
[2023-03-08 19:38:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 19:38:03] [INFO ] Flatten gal took : 20 ms
[2023-03-08 19:38:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-08 19:38:03] [INFO ] Time to serialize gal into /tmp/LTL10630035240129012912.gal : 12 ms
[2023-03-08 19:38:03] [INFO ] Time to serialize properties into /tmp/LTL4180184130400263212.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10630035240129012912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4180184130400263212.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(((i18.u113.F309<1)||(i1.i1.u117.Section_308<1))||((i12.i0.u52.F75<1)||(i12.i0.u26.Section_74<1)))"))||((F("((i2.i1.u79.F15...299
Formula 0 simplified : XX(F!"(((i18.u113.F309<1)||(i1.i1.u117.Section_308<1))||((i12.i0.u52.F75<1)||(i12.i0.u26.Section_74<1)))" & (!"(((i18.u113.F309<1)||...289
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8476403482626900613
[2023-03-08 19:38:18] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8476403482626900613
Running compilation step : cd /tmp/ltsmin8476403482626900613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1108 ms.
Running link step : cd /tmp/ltsmin8476403482626900613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8476403482626900613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||(<>((LTLAPp1==true))&&(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-13 finished in 109891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(!p0)))&&F(p1)))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2023-03-08 19:38:33] [INFO ] Computed 272 place invariants in 5 ms
[2023-03-08 19:38:34] [INFO ] Implicit Places using invariants in 770 ms returned [88, 182, 187, 260, 302, 336, 386, 387, 420, 574, 583, 632, 646, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 772 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/655 places, 384/384 transitions.
Applied a total of 0 rules in 23 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 814 ms. Remains : 641/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), false, (NOT p1), p0, true]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s11 1) (LT s533 1)), p0:(AND (GEQ s57 1) (GEQ s637 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 372 steps with 0 reset in 10 ms.
FORMULA CircularTrains-PT-384-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-14 finished in 1088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G((p1&&(p0 U (p2||G(p0)))))))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 19:38:35] [INFO ] Invariant cache hit.
[2023-03-08 19:38:35] [INFO ] Implicit Places using invariants in 861 ms returned [88, 182, 187, 260, 302, 386, 387, 420, 542, 574, 583, 632, 646, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 863 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/655 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 893 ms. Remains : 641/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s80 1) (GEQ s459 1)), p2:(AND (NOT (AND (GEQ s153 1) (GEQ s331 1))) (GEQ s80 1) (GEQ s459 1)), p1:(OR (LT s5 1) (LT s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 68 steps with 0 reset in 2 ms.
FORMULA CircularTrains-PT-384-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-15 finished in 1010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Found a Shortening insensitive property : CircularTrains-PT-384-LTLFireability-02
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 655 transition count 286
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 197 place count 557 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 32 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2023-03-08 19:38:36] [INFO ] Computed 272 place invariants in 5 ms
[2023-03-08 19:38:36] [INFO ] Implicit Places using invariants in 683 ms returned [77, 150, 154, 214, 251, 277, 315, 316, 345, 434, 461, 512, 527]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 684 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 517/655 places, 259/384 transitions.
Drop transitions 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 517 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 516 transition count 258
Applied a total of 2 rules in 16 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2023-03-08 19:38:36] [INFO ] Computed 259 place invariants in 3 ms
[2023-03-08 19:38:37] [INFO ] Implicit Places using invariants in 769 ms returned []
[2023-03-08 19:38:37] [INFO ] Invariant cache hit.
[2023-03-08 19:38:38] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 516/655 places, 258/384 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2274 ms. Remains : 516/655 places, 258/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s203 1) (LT s509 1)), p2:(AND (GEQ s221 1) (GEQ s435 1)), p1:(AND (GEQ s302 1) (GEQ s455 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 865 reset in 2705 ms.
Product exploration explored 100000 steps with 868 reset in 2308 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 908 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 1672 steps, including 0 resets, run visited all 8 properties in 67 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1086 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 9 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 19:38:46] [INFO ] Invariant cache hit.
[2023-03-08 19:38:46] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-08 19:38:46] [INFO ] Invariant cache hit.
[2023-03-08 19:38:47] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
[2023-03-08 19:38:47] [INFO ] Invariant cache hit.
[2023-03-08 19:38:48] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2097 ms. Remains : 516/516 places, 258/258 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 (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 911 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 1748 steps, including 0 resets, run visited all 8 properties in 46 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1232 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 852 reset in 2496 ms.
Product exploration explored 100000 steps with 860 reset in 2295 ms.
Built C files in :
/tmp/ltsmin8884916703512782875
[2023-03-08 19:38:56] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8884916703512782875
Running compilation step : cd /tmp/ltsmin8884916703512782875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 924 ms.
Running link step : cd /tmp/ltsmin8884916703512782875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8884916703512782875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3675466929530762554.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 8 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 19:39:11] [INFO ] Invariant cache hit.
[2023-03-08 19:39:11] [INFO ] Implicit Places using invariants in 621 ms returned []
[2023-03-08 19:39:11] [INFO ] Invariant cache hit.
[2023-03-08 19:39:12] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
[2023-03-08 19:39:12] [INFO ] Invariant cache hit.
[2023-03-08 19:39:13] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1999 ms. Remains : 516/516 places, 258/258 transitions.
Built C files in :
/tmp/ltsmin7693539841460775323
[2023-03-08 19:39:13] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7693539841460775323
Running compilation step : cd /tmp/ltsmin7693539841460775323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1075 ms.
Running link step : cd /tmp/ltsmin7693539841460775323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7693539841460775323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2581359614435423.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 19:39:28] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:39:28] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:39:28] [INFO ] Time to serialize gal into /tmp/LTL11594864020834734170.gal : 2 ms
[2023-03-08 19:39:28] [INFO ] Time to serialize properties into /tmp/LTL8793935695404680326.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11594864020834734170.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8250575757664581744.hoa' '-atoms' '/tmp/LTL8793935695404680326.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8793935695404680326.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8250575757664581744.hoa
Detected timeout of ITS tools.
[2023-03-08 19:39:43] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:39:43] [INFO ] Flatten gal took : 13 ms
[2023-03-08 19:39:43] [INFO ] Time to serialize gal into /tmp/LTL15587117879357834873.gal : 3 ms
[2023-03-08 19:39:43] [INFO ] Time to serialize properties into /tmp/LTL6408469275220081511.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15587117879357834873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6408469275220081511.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((Section_34<1)||(F35<1))"))||(X((X(!("((Section_115>=1)&&(F116>=1))")))U((X(G(!("((Section_115>=1)&&(F116>=1))"))))||((!("((...233
Formula 0 simplified : G(F!"((Section_34<1)||(F35<1))" & X(X"((Section_115>=1)&&(F116>=1))" R (XF"((Section_115>=1)&&(F116>=1))" & ("((F112>=1)&&(Section_1...202
Detected timeout of ITS tools.
[2023-03-08 19:39:58] [INFO ] Flatten gal took : 14 ms
[2023-03-08 19:39:58] [INFO ] Applying decomposition
[2023-03-08 19:39:58] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5218567557253210045.txt' '-o' '/tmp/graph5218567557253210045.bin' '-w' '/tmp/graph5218567557253210045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5218567557253210045.bin' '-l' '-1' '-v' '-w' '/tmp/graph5218567557253210045.weights' '-q' '0' '-e' '0.001'
[2023-03-08 19:39:58] [INFO ] Decomposing Gal with order
[2023-03-08 19:39:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 19:39:58] [INFO ] Flatten gal took : 28 ms
[2023-03-08 19:39:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-08 19:39:58] [INFO ] Time to serialize gal into /tmp/LTL12020160035724611837.gal : 6 ms
[2023-03-08 19:39:58] [INFO ] Time to serialize properties into /tmp/LTL1789886164677641748.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12020160035724611837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1789886164677641748.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i11.u98.Section_34<1)||(i11.u98.F35<1))"))||(X((X(!("((i7.u143.Section_115>=1)&&(i7.u143.F116>=1))")))U((X(G(!("((i7.u143.S...313
Formula 0 simplified : G(F!"((i11.u98.Section_34<1)||(i11.u98.F35<1))" & X(X"((i7.u143.Section_115>=1)&&(i7.u143.F116>=1))" R (XF"((i7.u143.Section_115>=1)...282
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1139064214451860564
[2023-03-08 19:40:13] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1139064214451860564
Running compilation step : cd /tmp/ltsmin1139064214451860564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1065 ms.
Running link step : cd /tmp/ltsmin1139064214451860564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1139064214451860564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X((X(!(LTLAPp1==true)) U (X([](!(LTLAPp1==true)))||(!(LTLAPp2==true)&&X(!(LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 112857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(F(p2)&&F(p0)&&p1)))))'
Found a Shortening insensitive property : CircularTrains-PT-384-LTLFireability-12
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 198 place count 556 transition count 272
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 28 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2023-03-08 19:40:29] [INFO ] Computed 272 place invariants in 3 ms
[2023-03-08 19:40:30] [INFO ] Implicit Places using invariants in 672 ms returned [77, 150, 154, 250, 276, 314, 343, 433, 460, 466, 511, 521, 526]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 674 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 516/655 places, 258/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 713 ms. Remains : 516/655 places, 258/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (GEQ s139 1) (GEQ s308 1)), p0:(AND (GEQ s139 1) (GEQ s308 1)), p2:(AND (GEQ s210 1) (GEQ s340 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 540 reset in 1973 ms.
Product exploration explored 100000 steps with 546 reset in 2155 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) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 572 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 258 rows 516 cols
[2023-03-08 19:40:35] [INFO ] Computed 259 place invariants in 3 ms
[2023-03-08 19:40:35] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p2) p0)), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 832 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-08 19:40:36] [INFO ] Invariant cache hit.
[2023-03-08 19:40:37] [INFO ] [Real]Absence check using 255 positive place invariants in 148 ms returned sat
[2023-03-08 19:40:37] [INFO ] [Real]Absence check using 255 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 19:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:40:37] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2023-03-08 19:40:37] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-08 19:40:39] [INFO ] Added : 127 causal constraints over 26 iterations in 2248 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 8 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 19:40:39] [INFO ] Invariant cache hit.
[2023-03-08 19:40:40] [INFO ] Implicit Places using invariants in 767 ms returned []
[2023-03-08 19:40:40] [INFO ] Invariant cache hit.
[2023-03-08 19:40:41] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2023-03-08 19:40:41] [INFO ] Invariant cache hit.
[2023-03-08 19:40:42] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2330 ms. Remains : 516/516 places, 258/258 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))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 434 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Finished random walk after 336 steps, including 0 resets, run visited all 3 properties in 13 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 1 factoid took 393 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-08 19:40:43] [INFO ] Invariant cache hit.
[2023-03-08 19:40:44] [INFO ] [Real]Absence check using 255 positive place invariants in 148 ms returned sat
[2023-03-08 19:40:44] [INFO ] [Real]Absence check using 255 positive and 4 generalized place invariants in 36 ms returned sat
[2023-03-08 19:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:40:44] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2023-03-08 19:40:44] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-08 19:40:47] [INFO ] Added : 127 causal constraints over 26 iterations in 3363 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 528 reset in 2263 ms.
Product exploration explored 100000 steps with 546 reset in 2113 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 10 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 19:40:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:40:52] [INFO ] Invariant cache hit.
[2023-03-08 19:40:53] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 497 ms. Remains : 516/516 places, 258/258 transitions.
Built C files in :
/tmp/ltsmin7662586317613290089
[2023-03-08 19:40:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7662586317613290089
Running compilation step : cd /tmp/ltsmin7662586317613290089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 750 ms.
Running link step : cd /tmp/ltsmin7662586317613290089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7662586317613290089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8985327663440904460.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 19:41:08] [INFO ] Invariant cache hit.
[2023-03-08 19:41:08] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-08 19:41:08] [INFO ] Invariant cache hit.
[2023-03-08 19:41:09] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1646 ms to find 0 implicit places.
[2023-03-08 19:41:09] [INFO ] Invariant cache hit.
[2023-03-08 19:41:10] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2174 ms. Remains : 516/516 places, 258/258 transitions.
Built C files in :
/tmp/ltsmin15726258366877689617
[2023-03-08 19:41:10] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15726258366877689617
Running compilation step : cd /tmp/ltsmin15726258366877689617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 943 ms.
Running link step : cd /tmp/ltsmin15726258366877689617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin15726258366877689617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4584237124410506588.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 19:41:25] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:41:25] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:41:25] [INFO ] Time to serialize gal into /tmp/LTL10113352382299592258.gal : 2 ms
[2023-03-08 19:41:25] [INFO ] Time to serialize properties into /tmp/LTL18294267741110412517.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10113352382299592258.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1983175438026487786.hoa' '-atoms' '/tmp/LTL18294267741110412517.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18294267741110412517.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1983175438026487786.hoa
Detected timeout of ITS tools.
[2023-03-08 19:41:40] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:41:40] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:41:40] [INFO ] Time to serialize gal into /tmp/LTL1342803612878352793.gal : 2 ms
[2023-03-08 19:41:40] [INFO ] Time to serialize properties into /tmp/LTL17683093345167610792.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1342803612878352793.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17683093345167610792.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((Section_28>=1)&&(F29>=1))"))||(("((Section_28>=1)&&(F29>=1))")&&((F("((F158>=1)&&(Section_157>=1))"))&&(F("((Section_28>=...177
Formula 0 simplified : XG(F!"((Section_28>=1)&&(F29>=1))" & (!"((Section_28>=1)&&(F29>=1))" | G!"((F158>=1)&&(Section_157>=1))"))
Detected timeout of ITS tools.
[2023-03-08 19:41:55] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:41:55] [INFO ] Applying decomposition
[2023-03-08 19:41:55] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13623002893498743562.txt' '-o' '/tmp/graph13623002893498743562.bin' '-w' '/tmp/graph13623002893498743562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13623002893498743562.bin' '-l' '-1' '-v' '-w' '/tmp/graph13623002893498743562.weights' '-q' '0' '-e' '0.001'
[2023-03-08 19:41:55] [INFO ] Decomposing Gal with order
[2023-03-08 19:41:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 19:41:55] [INFO ] Flatten gal took : 22 ms
[2023-03-08 19:41:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-08 19:41:55] [INFO ] Time to serialize gal into /tmp/LTL15987300025180668912.gal : 4 ms
[2023-03-08 19:41:55] [INFO ] Time to serialize properties into /tmp/LTL17224099189589287511.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15987300025180668912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17224099189589287511.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((i18.i1.i0.u40.Section_28>=1)&&(i18.i1.i0.u40.F29>=1))"))||(("((i18.i1.i0.u40.Section_28>=1)&&(i18.i1.i0.u40.F29>=1))")&&(...291
Formula 0 simplified : XG(F!"((i18.i1.i0.u40.Section_28>=1)&&(i18.i1.i0.u40.F29>=1))" & (!"((i18.i1.i0.u40.Section_28>=1)&&(i18.i1.i0.u40.F29>=1))" | G!"((...215
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15431409617449094470
[2023-03-08 19:42:10] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15431409617449094470
Running compilation step : cd /tmp/ltsmin15431409617449094470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 814 ms.
Running link step : cd /tmp/ltsmin15431409617449094470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15431409617449094470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))||(<>((LTLAPp2==true))&&<>((LTLAPp0==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-12 finished in 116932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(!p0&&F(!p1))))))'
[2023-03-08 19:42:26] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8461136833379209621
[2023-03-08 19:42:26] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2023-03-08 19:42:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:42:26] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2023-03-08 19:42:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:42:26] [INFO ] Applying decomposition
[2023-03-08 19:42:26] [INFO ] Flatten gal took : 12 ms
[2023-03-08 19:42:26] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2023-03-08 19:42:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:42:26] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8461136833379209621
Running compilation step : cd /tmp/ltsmin8461136833379209621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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.202303021504/bin/convert-linux64' '-i' '/tmp/graph7150347970725943958.txt' '-o' '/tmp/graph7150347970725943958.bin' '-w' '/tmp/graph7150347970725943958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7150347970725943958.bin' '-l' '-1' '-v' '-w' '/tmp/graph7150347970725943958.weights' '-q' '0' '-e' '0.001'
[2023-03-08 19:42:26] [INFO ] Decomposing Gal with order
[2023-03-08 19:42:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 19:42:26] [INFO ] Flatten gal took : 26 ms
[2023-03-08 19:42:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-08 19:42:26] [INFO ] Time to serialize gal into /tmp/LTLFireability7385375177094941272.gal : 4 ms
[2023-03-08 19:42:26] [INFO ] Time to serialize properties into /tmp/LTLFireability10373650841112023139.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7385375177094941272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10373650841112023139.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((F((G("((i14.i0.u55.Section_34<1)||(i14.i0.u38.F35<1))"))||(X((X(!("((i23.i0.u85.Section_115>=1)&&(i23.i0.u2.F116>=1))")))U(((!("((i...338
Formula 0 simplified : G(F!"((i14.i0.u55.Section_34<1)||(i14.i0.u38.F35<1))" & X(X"((i23.i0.u85.Section_115>=1)&&(i23.i0.u2.F116>=1))" R (XF"((i23.i0.u85.S...307
Compilation finished in 1366 ms.
Running link step : cd /tmp/ltsmin8461136833379209621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8461136833379209621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X((X(!(LTLAPp1==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp1==true)))||X([](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: LTL layer: formula: <>(([]((LTLAPp0==true))||X((X(!(LTLAPp1==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp1==true)))||X([](!(LTLAPp1==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: "<>(([]((LTLAPp0==true))||X((X(!(LTLAPp1==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp1==true)))||X([](!(LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.042: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.175: There are 397 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.175: State length is 656, there are 407 groups
pins2lts-mc-linux64( 0/ 8), 0.175: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.175: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.175: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.175: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 1.427: [Blue] ~120 levels ~960 states ~106712 transitions
pins2lts-mc-linux64( 3/ 8), 1.639: [Blue] ~136 levels ~1920 states ~121112 transitions
pins2lts-mc-linux64( 3/ 8), 1.756: [Blue] ~138 levels ~3840 states ~123976 transitions
pins2lts-mc-linux64( 3/ 8), 1.928: [Blue] ~147 levels ~7680 states ~134608 transitions
pins2lts-mc-linux64( 3/ 8), 2.289: [Blue] ~167 levels ~15360 states ~156104 transitions
pins2lts-mc-linux64( 3/ 8), 2.957: [Blue] ~207 levels ~30720 states ~194136 transitions
pins2lts-mc-linux64( 3/ 8), 4.076: [Blue] ~334 levels ~61440 states ~284648 transitions
pins2lts-mc-linux64( 3/ 8), 5.637: [Blue] ~716 levels ~122880 states ~465944 transitions
pins2lts-mc-linux64( 3/ 8), 8.233: [Blue] ~1906 levels ~245760 states ~810784 transitions
pins2lts-mc-linux64( 4/ 8), 12.791: [Blue] ~12162 levels ~491520 states ~1465864 transitions
pins2lts-mc-linux64( 2/ 8), 21.297: [Blue] ~12222 levels ~983040 states ~2816368 transitions
pins2lts-mc-linux64( 2/ 8), 38.395: [Blue] ~12222 levels ~1966080 states ~5223032 transitions
pins2lts-mc-linux64( 4/ 8), 72.278: [Blue] ~12162 levels ~3932160 states ~8299664 transitions
pins2lts-mc-linux64( 3/ 8), 141.497: [Blue] ~12220 levels ~7864320 states ~15704808 transitions
pins2lts-mc-linux64( 3/ 8), 277.798: [Blue] ~12220 levels ~15728640 states ~31207360 transitions
pins2lts-mc-linux64( 4/ 8), 505.892: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 505.967:
pins2lts-mc-linux64( 0/ 8), 505.967: Explored 27544583 states 69393773 transitions, fanout: 2.519
pins2lts-mc-linux64( 0/ 8), 505.967: Total exploration time 505.780 sec (505.690 sec minimum, 505.732 sec on average)
pins2lts-mc-linux64( 0/ 8), 505.967: States per second: 54460, Transitions per second: 137202
pins2lts-mc-linux64( 0/ 8), 505.967:
pins2lts-mc-linux64( 0/ 8), 505.967: State space has 28378359 states, 186268 are accepting
pins2lts-mc-linux64( 0/ 8), 505.967: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 505.967: blue states: 27544583 (97.06%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 505.967: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 505.967: all-red states: 27443028 (96.70%), bogus 5103 (0.02%)
pins2lts-mc-linux64( 0/ 8), 505.967:
pins2lts-mc-linux64( 0/ 8), 505.967: Total memory used for local state coloring: 1.5MB
pins2lts-mc-linux64( 0/ 8), 505.967:
pins2lts-mc-linux64( 0/ 8), 505.967: Queue width: 8B, total height: 97645, memory: 0.74MB
pins2lts-mc-linux64( 0/ 8), 505.967: Tree memory: 472.5MB, 17.5 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 505.967: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 505.967: Stored 386 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 505.967: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 505.967: Est. total memory use: 473.3MB (~1024.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8461136833379209621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X((X(!(LTLAPp1==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp1==true)))||X([](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8461136833379209621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X((X(!(LTLAPp1==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp1==true)))||X([](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-08 20:07:28] [INFO ] Flatten gal took : 21 ms
[2023-03-08 20:07:28] [INFO ] Time to serialize gal into /tmp/LTLFireability18226961118975252287.gal : 6 ms
[2023-03-08 20:07:28] [INFO ] Time to serialize properties into /tmp/LTLFireability18243695264710168166.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18226961118975252287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18243695264710168166.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 5 LTL properties
Checking formula 0 : !((F((G("((Section_34<1)||(F35<1))"))||(X((X(!("((Section_115>=1)&&(F116>=1))")))U(((!("((F112>=1)&&(Section_111>=1))"))&&(X(!("((Sect...233
Formula 0 simplified : G(F!"((Section_34<1)||(F35<1))" & X(X"((Section_115>=1)&&(F116>=1))" R (XF"((Section_115>=1)&&(F116>=1))" & ("((F112>=1)&&(Section_1...202
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9259776 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16028564 kB
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-384"
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-5348"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-384, 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 r069-smll-167814396100188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-384.tgz
mv CircularTrains-PT-384 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 ;