About the Execution of 2023-gold for HouseConstruction-PT-32000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12352.000 | 3600000.00 | 3971670.00 | 9485.40 | TTFTTFFF?TTTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r219-smll-171649598000158.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HouseConstruction-PT-32000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649598000158
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716680916820
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-32000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 23:48:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 23:48:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:48:39] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-25 23:48:39] [INFO ] Transformed 26 places.
[2024-05-25 23:48:39] [INFO ] Transformed 18 transitions.
[2024-05-25 23:48:39] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HouseConstruction-PT-32000-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-32000-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-32000-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-32000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 20 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2024-05-25 23:48:40] [INFO ] Computed 8 invariants in 8 ms
[2024-05-25 23:48:40] [INFO ] Implicit Places using invariants in 323 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 417 ms. Remains : 25/26 places, 18/18 transitions.
Support contains 22 out of 25 places after structural reductions.
[2024-05-25 23:48:40] [INFO ] Flatten gal took : 27 ms
[2024-05-25 23:48:40] [INFO ] Flatten gal took : 10 ms
[2024-05-25 23:48:40] [INFO ] Input system was already deterministic with 18 transitions.
Support contains 21 out of 25 places (down from 22) after GAL structural reductions.
Incomplete random walk after 32001 steps, including 0 resets, run finished after 68 ms. (steps per millisecond=470 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 23:48:41] [INFO ] Computed 7 invariants in 2 ms
[2024-05-25 23:48:41] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-25 23:48:41] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 23:48:41] [INFO ] After 57ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-25 23:48:41] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 23:48:41] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-25 23:48:41] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 23:48:41] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 23:48:41] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 32006 steps, including 0 resets, run visited all 2 properties in 741 ms. (steps per millisecond=43 )
Parikh walk visited 2 properties in 744 ms.
Computed a total of 25 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 23:48:42] [INFO ] Computed 6 invariants in 3 ms
[2024-05-25 23:48:42] [INFO ] Implicit Places using invariants in 53 ms returned [8, 12, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 21/25 places, 18/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 311 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 370 ms.
Product exploration explored 100000 steps with 50000 reset in 287 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 30 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-00 finished in 1205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 2 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 7 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-25 23:48:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:48:43] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 23:48:43] [INFO ] Invariant cache hit.
[2024-05-25 23:48:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-25 23:48:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:48:43] [INFO ] Invariant cache hit.
[2024-05-25 23:48:43] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/25 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-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:(LT s1 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 1 reset in 256 ms.
Product exploration explored 100000 steps with 1 reset in 454 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-01 finished in 933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U G(!p1))&&G(F(p2)))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 18 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 17 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 15 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 15 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 11 transition count 8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 10 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 8 transition count 7
Applied a total of 16 rules in 16 ms. Remains 8 /25 variables (removed 17) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-25 23:48:44] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 23:48:44] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 23:48:44] [INFO ] Invariant cache hit.
[2024-05-25 23:48:44] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-25 23:48:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:48:44] [INFO ] Invariant cache hit.
[2024-05-25 23:48:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 8/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LT s3 1) (LT s6 1) (LT s7 1)), p1:(LT s1 1)], nbAcceptance=1, 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 1 reset in 246 ms.
Product exploration explored 100000 steps with 0 reset in 535 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1), (X (NOT p1)), (X p2), (X (X p2)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be false thanks to negative knowledge :(X (X (NOT p1)))
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-02 finished in 1337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 19 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 19 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 12 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 10 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 9 transition count 6
Applied a total of 25 rules in 10186 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-25 23:48:56] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 23:48:56] [INFO ] Implicit Places using invariants in 30 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10223 ms. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s4 1) (GEQ s5 1) (GEQ s7 1))) (LT s1 1)), p0:(LT s1 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 22 reset in 123 ms.
Product exploration explored 100000 steps with 2 reset in 146 ms.
Computed a total of 8 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-03 finished in 10639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U !p1)))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 23:48:56] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 23:48:56] [INFO ] Implicit Places using invariants in 38 ms returned [8, 12, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 219 ms :[p1, p1, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s7 1) (GEQ s13 1) (GEQ s14 1)), p0:(LT s2 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-04 finished in 473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(p1 U X(G(!p2))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 23:48:57] [INFO ] Invariant cache hit.
[2024-05-25 23:48:57] [INFO ] Implicit Places using invariants in 44 ms returned [8, 12, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), p2, p2, true]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s14 1)), p0:(AND (GEQ s21 1) (GEQ s13 1) (GEQ s14 1)), p2:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-32000-LTLFireability-05 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 23:48:57] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 23:48:57] [INFO ] Implicit Places using invariants in 51 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s20 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][false, false]]
Product exploration explored 100000 steps with 1481 reset in 195 ms.
Product exploration explored 100000 steps with 1475 reset in 399 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Incomplete random walk after 32001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=2285 ) properties (out of 1) seen :0
Finished Best-First random walk after 706 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=235 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 163 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 23:48:58] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 23:48:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 23:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:48:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-25 23:48:58] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 23:48:58] [INFO ] Added : 17 causal constraints over 4 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 11
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 15 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 15 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 11 transition count 7
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 24 place count 8 transition count 5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 6 transition count 4
Applied a total of 27 rules in 45604 ms. Remains 6 /22 variables (removed 16) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-25 23:49:44] [INFO ] Computed 2 invariants in 3 ms
[2024-05-25 23:49:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 23:49:44] [INFO ] Invariant cache hit.
[2024-05-25 23:49:44] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-25 23:49:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:49:44] [INFO ] Invariant cache hit.
[2024-05-25 23:49:44] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/22 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45689 ms. Remains : 6/22 places, 4/18 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 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)]
Incomplete random walk after 32001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=6400 ) properties (out of 1) seen :0
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 115 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)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-25 23:49:44] [INFO ] Invariant cache hit.
[2024-05-25 23:49:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 23:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:49:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:49:45] [INFO ] Computed and/alt/rep : 2/4/2 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:49:45] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15151 reset in 73 ms.
Product exploration explored 100000 steps with 15064 reset in 90 ms.
Built C files in :
/tmp/ltsmin10062434043118556022
[2024-05-25 23:49:45] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 23:49:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:49:45] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 23:49:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:49:45] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 23:49:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:49:45] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10062434043118556022
Running compilation step : cd /tmp/ltsmin10062434043118556022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 290 ms.
Running link step : cd /tmp/ltsmin10062434043118556022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin10062434043118556022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4913002714735570217.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:50:00] [INFO ] Invariant cache hit.
[2024-05-25 23:50:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 23:50:00] [INFO ] Invariant cache hit.
[2024-05-25 23:50:00] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-25 23:50:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:50:00] [INFO ] Invariant cache hit.
[2024-05-25 23:50:00] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 6/6 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin14808216002592130070
[2024-05-25 23:50:00] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 23:50:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:50:00] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 23:50:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:50:00] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 23:50:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:50:00] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14808216002592130070
Running compilation step : cd /tmp/ltsmin14808216002592130070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin14808216002592130070;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14808216002592130070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15105395164222071813.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 23:50:15] [INFO ] Flatten gal took : 5 ms
[2024-05-25 23:50:15] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:50:15] [INFO ] Time to serialize gal into /tmp/LTL15812484304003327392.gal : 1 ms
[2024-05-25 23:50:15] [INFO ] Time to serialize properties into /tmp/LTL236987048911114148.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15812484304003327392.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8593743196759776737.hoa' '-atoms' '/tmp/LTL236987048911114148.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL236987048911114148.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8593743196759776737.hoa
Detected timeout of ITS tools.
[2024-05-25 23:50:30] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:50:30] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:50:30] [INFO ] Time to serialize gal into /tmp/LTL12315898907465671573.gal : 1 ms
[2024-05-25 23:50:30] [INFO ] Time to serialize properties into /tmp/LTL14442930119743281109.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12315898907465671573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14442930119743281109.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F("(((p27>=1)&&(p26>=1))&&(p25>=1))"))))
Formula 0 simplified : XG!"(((p27>=1)&&(p26>=1))&&(p25>=1))"
Detected timeout of ITS tools.
[2024-05-25 23:50:45] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:50:45] [INFO ] Applying decomposition
[2024-05-25 23:50:45] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11688318965467329284.txt' '-o' '/tmp/graph11688318965467329284.bin' '-w' '/tmp/graph11688318965467329284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11688318965467329284.bin' '-l' '-1' '-v' '-w' '/tmp/graph11688318965467329284.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:50:45] [INFO ] Decomposing Gal with order
[2024-05-25 23:50:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:50:45] [INFO ] Flatten gal took : 36 ms
[2024-05-25 23:50:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 23:50:45] [INFO ] Time to serialize gal into /tmp/LTL7847505930259373649.gal : 1 ms
[2024-05-25 23:50:45] [INFO ] Time to serialize properties into /tmp/LTL16605318030474233302.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7847505930259373649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16605318030474233302.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("(((u1.p27>=1)&&(u2.p26>=1))&&(u0.p25>=1))"))))
Formula 0 simplified : XG!"(((u1.p27>=1)&&(u2.p26>=1))&&(u0.p25>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4957773395399155076
[2024-05-25 23:51:00] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4957773395399155076
Running compilation step : cd /tmp/ltsmin4957773395399155076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin4957773395399155076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4957773395399155076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-32000-LTLFireability-08 finished in 138523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||G(F(p1)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 11 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 7 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 5 place count 7 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4 transition count 4
Applied a total of 10 rules in 9691 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-25 23:51:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:51:25] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 23:51:25] [INFO ] Invariant cache hit.
[2024-05-25 23:51:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-25 23:51:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:51:25] [INFO ] Invariant cache hit.
[2024-05-25 23:51:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9766 ms. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1 1), p1:(GEQ s3 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 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-09 finished in 10093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (G(p0)||(p0&&(p1 U G((F(p3)&&p2)))))))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 23:51:26] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 23:51:26] [INFO ] Implicit Places using invariants in 36 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 24/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p1:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p0:(LT s18 1), p3:(AND (GEQ s15 1) (GEQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2394 reset in 254 ms.
Product exploration explored 100000 steps with 2322 reset in 290 ms.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 (NOT p3)), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1) p0)), (X p0), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) p0))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p3)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 26 factoid took 41 ms. Reduced automaton from 5 states, 25 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-11 finished in 1068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 6 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 9605 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-25 23:51:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:51:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 23:51:36] [INFO ] Invariant cache hit.
[2024-05-25 23:51:36] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-25 23:51:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:51:36] [INFO ] Invariant cache hit.
[2024-05-25 23:51:36] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/25 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9708 ms. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 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 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-12 finished in 9981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0))&&F((!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 9 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 10 output transitions
Drop transitions removed 10 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 2 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 7 transition count 6
Applied a total of 5 rules in 4 ms. Remains 7 /25 variables (removed 18) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-25 23:51:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 23:51:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 23:51:37] [INFO ] Invariant cache hit.
[2024-05-25 23:51:37] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-25 23:51:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:51:37] [INFO ] Invariant cache hit.
[2024-05-25 23:51:37] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND (NOT p2) p1)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s4 1), p2:(AND (LT s0 1) (NOT (AND (GEQ s5 1) (GEQ s6 1)))), p1:(GEQ s0 1)], nbAcceptance=1, 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 143 ms.
Product exploration explored 100000 steps with 0 reset in 188 ms.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p2) p1))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 29 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-14 finished in 758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(F(p0))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 14 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 9 transition count 6
Applied a total of 8 rules in 46076 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-25 23:52:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 23:52:24] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 23:52:24] [INFO ] Invariant cache hit.
[2024-05-25 23:52:24] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-25 23:52:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:52:24] [INFO ] Invariant cache hit.
[2024-05-25 23:52:24] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46213 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} 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 s3 1) (GEQ s6 1) (GEQ s7 1)), p0:(LT s8 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 2224 reset in 94 ms.
Product exploration explored 100000 steps with 3357 reset in 162 ms.
Computed a total of 9 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 23 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-15 finished in 46705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : HouseConstruction-PT-32000-LTLFireability-08
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 18 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 18 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 12 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 11 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 11 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 9 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 27 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 29 place count 6 transition count 4
Applied a total of 29 rules in 45039 ms. Remains 6 /25 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-25 23:53:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-25 23:53:09] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 23:53:10] [INFO ] Invariant cache hit.
[2024-05-25 23:53:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-25 23:53:10] [INFO ] Invariant cache hit.
[2024-05-25 23:53:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 6/25 places, 4/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 45123 ms. Remains : 6/25 places, 4/18 transitions.
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15094 reset in 63 ms.
Product exploration explored 100000 steps with 15143 reset in 77 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 32001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=5333 ) properties (out of 1) seen :0
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 178 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 68 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
[2024-05-25 23:53:10] [INFO ] Invariant cache hit.
[2024-05-25 23:53:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 23:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:53:10] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:53:10] [INFO ] Computed and/alt/rep : 2/4/2 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:53:10] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:53:10] [INFO ] Invariant cache hit.
[2024-05-25 23:53:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 23:53:10] [INFO ] Invariant cache hit.
[2024-05-25 23:53:10] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-25 23:53:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:53:10] [INFO ] Invariant cache hit.
[2024-05-25 23:53:10] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 6/6 places, 4/4 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 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 45 ms :[(NOT p0)]
Incomplete random walk after 32001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=6400 ) properties (out of 1) seen :0
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 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 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-25 23:53:11] [INFO ] Invariant cache hit.
[2024-05-25 23:53:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-25 23:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:53:11] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-25 23:53:11] [INFO ] Computed and/alt/rep : 2/4/2 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:53:11] [INFO ] Added : 2 causal constraints over 1 iterations in 8 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 15075 reset in 77 ms.
Product exploration explored 100000 steps with 15016 reset in 78 ms.
Built C files in :
/tmp/ltsmin13877580634880954169
[2024-05-25 23:53:11] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 23:53:11] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:53:11] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 23:53:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:53:11] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 23:53:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:53:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13877580634880954169
Running compilation step : cd /tmp/ltsmin13877580634880954169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin13877580634880954169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13877580634880954169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17440225773696042310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 5 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:53:27] [INFO ] Invariant cache hit.
[2024-05-25 23:53:27] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 23:53:27] [INFO ] Invariant cache hit.
[2024-05-25 23:53:27] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-25 23:53:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:53:27] [INFO ] Invariant cache hit.
[2024-05-25 23:53:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 6/6 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin772081167792936760
[2024-05-25 23:53:27] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 23:53:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:53:27] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 23:53:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:53:27] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 23:53:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:53:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin772081167792936760
Running compilation step : cd /tmp/ltsmin772081167792936760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin772081167792936760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin772081167792936760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12565879208325120998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 23:53:42] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:53:42] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:53:42] [INFO ] Time to serialize gal into /tmp/LTL13318757045289918240.gal : 1 ms
[2024-05-25 23:53:42] [INFO ] Time to serialize properties into /tmp/LTL8191343264766998574.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13318757045289918240.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3293326045471022867.hoa' '-atoms' '/tmp/LTL8191343264766998574.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8191343264766998574.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3293326045471022867.hoa
Detected timeout of ITS tools.
[2024-05-25 23:53:57] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:53:57] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:53:57] [INFO ] Time to serialize gal into /tmp/LTL17285431759770754482.gal : 1 ms
[2024-05-25 23:53:57] [INFO ] Time to serialize properties into /tmp/LTL18106410265838814593.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17285431759770754482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18106410265838814593.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F("(((p27>=1)&&(p26>=1))&&(p25>=1))"))))
Formula 0 simplified : XG!"(((p27>=1)&&(p26>=1))&&(p25>=1))"
Detected timeout of ITS tools.
[2024-05-25 23:54:12] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:54:12] [INFO ] Applying decomposition
[2024-05-25 23:54:12] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17358988728861301209.txt' '-o' '/tmp/graph17358988728861301209.bin' '-w' '/tmp/graph17358988728861301209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17358988728861301209.bin' '-l' '-1' '-v' '-w' '/tmp/graph17358988728861301209.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:54:12] [INFO ] Decomposing Gal with order
[2024-05-25 23:54:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:54:12] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:54:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 23:54:12] [INFO ] Time to serialize gal into /tmp/LTL15733589583510201339.gal : 1 ms
[2024-05-25 23:54:12] [INFO ] Time to serialize properties into /tmp/LTL996372237191726229.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15733589583510201339.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL996372237191726229.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F("(((u1.p27>=1)&&(u2.p26>=1))&&(u0.p25>=1))"))))
Formula 0 simplified : XG!"(((u1.p27>=1)&&(u2.p26>=1))&&(u0.p25>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17667335390846408392
[2024-05-25 23:54:27] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17667335390846408392
Running compilation step : cd /tmp/ltsmin17667335390846408392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin17667335390846408392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17667335390846408392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-32000-LTLFireability-08 finished in 137887 ms.
[2024-05-25 23:54:42] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12531338894523322034
[2024-05-25 23:54:42] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-25 23:54:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:54:42] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-25 23:54:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:54:42] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-25 23:54:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:54:42] [INFO ] Applying decomposition
[2024-05-25 23:54:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12531338894523322034
Running compilation step : cd /tmp/ltsmin12531338894523322034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 23:54:42] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3881877266602575323.txt' '-o' '/tmp/graph3881877266602575323.bin' '-w' '/tmp/graph3881877266602575323.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3881877266602575323.bin' '-l' '-1' '-v' '-w' '/tmp/graph3881877266602575323.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:54:42] [INFO ] Decomposing Gal with order
[2024-05-25 23:54:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:54:42] [INFO ] Flatten gal took : 5 ms
[2024-05-25 23:54:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 23:54:42] [INFO ] Time to serialize gal into /tmp/LTLFireability9081912797799151699.gal : 2 ms
[2024-05-25 23:54:42] [INFO ] Time to serialize properties into /tmp/LTLFireability9456724533850403174.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9081912797799151699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9456724533850403174.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(((i3.u7.p27>=1)&&(i4.u8.p26>=1))&&(i1.u9.p25>=1))"))))
Formula 0 simplified : XG!"(((i3.u7.p27>=1)&&(i4.u8.p26>=1))&&(i1.u9.p25>=1))"
Compilation finished in 127 ms.
Running link step : cd /tmp/ltsmin12531338894523322034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12531338894523322034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: LTL layer: formula: X(<>((LTLAPp0==true)))
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: "X(<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: buchi has 2 states
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.049: DFS-FIFO for weak LTL, using special progress label 20
pins2lts-mc-linux64( 0/ 8), 0.049: There are 21 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.049: State length is 26, there are 20 groups
pins2lts-mc-linux64( 0/ 8), 0.049: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.049: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.049: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.049: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.129: ~114 levels ~960 states ~7608 transitions
pins2lts-mc-linux64( 2/ 8), 0.268: ~224 levels ~1920 states ~17080 transitions
pins2lts-mc-linux64( 4/ 8), 0.544: ~450 levels ~3840 states ~43288 transitions
pins2lts-mc-linux64( 4/ 8), 0.897: ~898 levels ~7680 states ~92704 transitions
pins2lts-mc-linux64( 4/ 8), 1.476: ~1798 levels ~15360 states ~195648 transitions
pins2lts-mc-linux64( 6/ 8), 2.126: ~3600 levels ~30720 states ~414632 transitions
pins2lts-mc-linux64( 7/ 8), 2.764: ~7194 levels ~61440 states ~849288 transitions
pins2lts-mc-linux64( 4/ 8), 3.286: ~14469 levels ~122880 states ~1805088 transitions
pins2lts-mc-linux64( 7/ 8), 3.966: ~28884 levels ~245760 states ~3708280 transitions
pins2lts-mc-linux64( 4/ 8), 5.185: ~57876 levels ~491520 states ~7553520 transitions
pins2lts-mc-linux64( 4/ 8), 8.141: ~115859 levels ~983040 states ~15258856 transitions
pins2lts-mc-linux64( 0/ 8), 16.510: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 17.226:
pins2lts-mc-linux64( 0/ 8), 17.226: mean standard work distribution: 4.4% (states) 4.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 17.226:
pins2lts-mc-linux64( 0/ 8), 17.226: Explored 1288701 states 20085145 transitions, fanout: 15.586
pins2lts-mc-linux64( 0/ 8), 17.226: Total exploration time 17.170 sec (16.550 sec minimum, 16.906 sec on average)
pins2lts-mc-linux64( 0/ 8), 17.226: States per second: 75055, Transitions per second: 1169781
pins2lts-mc-linux64( 0/ 8), 17.226:
pins2lts-mc-linux64( 0/ 8), 17.226: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 17.226: Redundant explorations: -93.5838
pins2lts-mc-linux64( 0/ 8), 17.226:
pins2lts-mc-linux64( 0/ 8), 17.226: Queue width: 8B, total height: 1215048, memory: 9.27MB
pins2lts-mc-linux64( 0/ 8), 17.226: Tree memory: 409.2MB, 21.4 B/state, compr.: 20.2%
pins2lts-mc-linux64( 0/ 8), 17.226: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 17.226: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 17.226: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 17.226: Est. total memory use: 418.5MB (~1033.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12531338894523322034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12531338894523322034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==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)
Detected timeout of ITS tools.
[2024-05-26 00:16:43] [INFO ] Flatten gal took : 3 ms
[2024-05-26 00:16:43] [INFO ] Time to serialize gal into /tmp/LTLFireability14110475740682436134.gal : 1 ms
[2024-05-26 00:16:43] [INFO ] Time to serialize properties into /tmp/LTLFireability11100052443636930653.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14110475740682436134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11100052443636930653.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(F("(((p27>=1)&&(p26>=1))&&(p25>=1))"))))
Formula 0 simplified : XG!"(((p27>=1)&&(p26>=1))&&(p25>=1))"
Detected timeout of ITS tools.
[2024-05-26 00:38:43] [INFO ] Flatten gal took : 3 ms
[2024-05-26 00:38:43] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-26 00:38:43] [INFO ] Transformed 25 places.
[2024-05-26 00:38:43] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 00:38:43] [INFO ] Time to serialize gal into /tmp/LTLFireability10614045421260721483.gal : 1 ms
[2024-05-26 00:38:43] [INFO ] Time to serialize properties into /tmp/LTLFireability17962827108255901486.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10614045421260721483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17962827108255901486.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F("(((p27>=1)&&(p26>=1))&&(p25>=1))"))))
Formula 0 simplified : XG!"(((p27>=1)&&(p26>=1))&&(p25>=1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10896808 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16037056 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="HouseConstruction-PT-32000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is HouseConstruction-PT-32000, 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 r219-smll-171649598000158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-32000.tgz
mv HouseConstruction-PT-32000 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 ;