About the Execution of ITS-Tools for BridgeAndVehicles-PT-V50P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFTFT?FTFTFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765000388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is BridgeAndVehicles-PT-V50P20N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765000388
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 172K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 660K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 162K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 483K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 263K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 374K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.5M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748974992495
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 18:23:14] [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]
[2025-06-03 18:23:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 18:23:15] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2025-06-03 18:23:15] [INFO ] Transformed 128 places.
[2025-06-03 18:23:15] [INFO ] Transformed 1328 transitions.
[2025-06-03 18:23:15] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 482 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 57 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 66 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2025-06-03 18:23:16] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2025-06-03 18:23:16] [INFO ] Computed 5 invariants in 24 ms
[2025-06-03 18:23:16] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:23:30] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:23:39] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 8 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 7 constraints, problems are : Problem set: 50 solved, 1275 unsolved in 20143 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 50 solved, 1275 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 1275 unsolved
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/376 variables, and 7 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 151/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44187ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 44253ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
[2025-06-03 18:24:00] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2025-06-03 18:24:00] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:24:00] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-03 18:24:00] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:24:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:24:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:24:00] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 22 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44780 ms. Remains : 126/128 places, 1228/1328 transitions.
Support contains 126 out of 126 places after structural reductions.
[2025-06-03 18:24:01] [INFO ] Flatten gal took : 230 ms
[2025-06-03 18:24:02] [INFO ] Flatten gal took : 239 ms
[2025-06-03 18:24:03] [INFO ] Input system was already deterministic with 1228 transitions.
Reduction of identical properties reduced properties to check from 30 to 28
RANDOM walk for 40001 steps (88 resets) in 6100 ms. (6 steps per ms) remains 3/28 properties
BEST_FIRST walk for 40004 steps (32 resets) in 5342 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (40 resets) in 335 ms. (119 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (32 resets) in 366 ms. (108 steps per ms) remains 3/3 properties
[2025-06-03 18:24:06] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:24:06] [INFO ] Invariant cache hit.
[2025-06-03 18:24:06] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/123 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 248/371 variables, 123/128 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 20/148 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/374 variables, 3/151 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 151 constraints, problems are : Problem set: 2 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/119 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/365 variables, 119/123 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 20/143 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/374 variables, 7/150 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 1/151 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 1/152 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/374 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 152 constraints, problems are : Problem set: 2 solved, 1 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1223ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 121 transition count 1224
Applied a total of 9 rules in 378 ms. Remains 121 /126 variables (removed 5) and now considering 1224/1228 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 121/126 places, 1224/1228 transitions.
RANDOM walk for 40000 steps (126 resets) in 663 ms. (60 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (60 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 324112 steps, run visited all 1 properties in 2872 ms. (steps per millisecond=112 )
Probabilistic random walk after 324112 steps, saw 98676 distinct states, run finished after 2877 ms. (steps per millisecond=112 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 109 stabilizing places and 204 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||G(p1)))&&(!p2||G(p2)))))'
Support contains 116 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 24 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 18:24:12] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2025-06-03 18:24:12] [INFO ] Computed 5 invariants in 6 ms
[2025-06-03 18:24:12] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:24:25] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43315ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 43326ms
[2025-06-03 18:24:56] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:24:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:24:56] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-03 18:24:56] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:24:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:24:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:24:57] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1227 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1227/1228 transitions.
Applied a total of 0 rules in 13 ms. Remains 123 /123 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44596 ms. Remains : 123/126 places, 1227/1228 transitions.
Stuttering acceptance computed with spot in 534 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-00 finished in 45361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(p0))&&(G(!p1) U p2)))))'
Support contains 57 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 24 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 18:24:58] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:24:58] [INFO ] Invariant cache hit.
[2025-06-03 18:24:58] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:10] [INFO ] Deduced a trap composed of 5 places in 412 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43017ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 43025ms
[2025-06-03 18:25:41] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:25:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:25:41] [INFO ] Implicit Places using invariants in 365 ms returned []
[2025-06-03 18:25:41] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:25:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:25:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:25:42] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1680 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1227/1228 transitions.
Applied a total of 0 rules in 13 ms. Remains 124 /124 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44748 ms. Remains : 124/126 places, 1227/1228 transitions.
Stuttering acceptance computed with spot in 745 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-01
Product exploration explored 100000 steps with 694 reset in 1437 ms.
Product exploration explored 100000 steps with 688 reset in 1084 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/124 stabilizing places and 203/1227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (OR p2 (NOT p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (OR p2 (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 403 ms. Reduced automaton from 11 states, 42 edges and 3 AP (stutter sensitive) to 11 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 723 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 799 steps (0 resets) in 86 ms. (9 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (OR p2 (NOT p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (OR p2 (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 20 factoid took 1489 ms. Reduced automaton from 11 states, 42 edges and 3 AP (stutter sensitive) to 11 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 710 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 702 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2025-06-03 18:25:50] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 124 cols
[2025-06-03 18:25:50] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:25:50] [INFO ] [Real]Absence check using 5 positive place invariants in 30 ms returned sat
[2025-06-03 18:25:53] [INFO ] [Real]Absence check using state equation in 2222 ms returned sat
[2025-06-03 18:25:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:25:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2025-06-03 18:25:54] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2025-06-03 18:25:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:25:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 271 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:54] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 6 ms to minimize.
[2025-06-03 18:25:56] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1858 ms
Could not prove EG (NOT p2)
[2025-06-03 18:25:56] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:25:58] [INFO ] [Real]Absence check using 5 positive place invariants in 33 ms returned sat
[2025-06-03 18:26:00] [INFO ] [Real]Absence check using state equation in 2527 ms returned sat
[2025-06-03 18:26:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:26:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2025-06-03 18:26:03] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2025-06-03 18:26:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:26:03] [INFO ] [Nat]Added 20 Read/Feed constraints in 52 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:26:03] [INFO ] Deduced a trap composed of 14 places in 331 ms of which 9 ms to minimize.
[2025-06-03 18:26:05] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1847 ms
Could not prove EG (NOT p0)
Support contains 57 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1227/1227 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 18:26:05] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:26:05] [INFO ] Invariant cache hit.
[2025-06-03 18:26:05] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:26:18] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 51/1173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43529ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 43534ms
[2025-06-03 18:26:48] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:26:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:26:49] [INFO ] Implicit Places using invariants in 331 ms returned []
[2025-06-03 18:26:49] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:26:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:26:50] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Running 1224 sub problems to find dead transitions.
[2025-06-03 18:26:50] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:26:50] [INFO ] Invariant cache hit.
[2025-06-03 18:26:50] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:27:03] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/371 variables, 124/130 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 20/150 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1321 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 31844 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65014ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 65021ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/124 places, 1225/1227 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109900 ms. Remains : 124/124 places, 1225/1227 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 355 ms. Reduced automaton from 11 states, 42 edges and 3 AP (stutter sensitive) to 11 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 676 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 725 steps (0 resets) in 45 ms. (15 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 20 factoid took 1267 ms. Reduced automaton from 11 states, 42 edges and 3 AP (stutter sensitive) to 11 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 704 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 689 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2025-06-03 18:27:58] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2025-06-03 18:27:58] [INFO ] Computed 6 invariants in 5 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:27:59] [INFO ] [Real]Absence check using 6 positive place invariants in 35 ms returned sat
[2025-06-03 18:28:01] [INFO ] [Real]Absence check using state equation in 2189 ms returned sat
[2025-06-03 18:28:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:28:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2025-06-03 18:28:02] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2025-06-03 18:28:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:28:02] [INFO ] [Nat]Added 20 Read/Feed constraints in 92 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:28:03] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 18 ms to minimize.
[2025-06-03 18:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2025-06-03 18:28:03] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 117 ms.
[2025-06-03 18:28:03] [INFO ] Added : 7 causal constraints over 3 iterations in 388 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-03 18:28:03] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-03 18:28:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:28:05] [INFO ] [Real]Absence check using 6 positive place invariants in 24 ms returned sat
[2025-06-03 18:28:07] [INFO ] [Real]Absence check using state equation in 2421 ms returned sat
[2025-06-03 18:28:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:28:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 19 ms returned sat
[2025-06-03 18:28:10] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2025-06-03 18:28:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:28:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 220 ms returned sat
[2025-06-03 18:28:10] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 74 ms.
[2025-06-03 18:28:13] [INFO ] Added : 50 causal constraints over 10 iterations in 2386 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 619 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 682 reset in 1744 ms.
Product exploration explored 100000 steps with 670 reset in 1227 ms.
Built C files in :
/tmp/ltsmin955795361967544969
[2025-06-03 18:28:17] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin955795361967544969
Running compilation step : cd /tmp/ltsmin955795361967544969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin955795361967544969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin955795361967544969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 57 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2025-06-03 18:28:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-03 18:28:20] [INFO ] Invariant cache hit.
[2025-06-03 18:28:20] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:28:33] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 51/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43121ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 43128ms
[2025-06-03 18:29:03] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-03 18:29:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:29:03] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-06-03 18:29:03] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-03 18:29:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:29:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:29:04] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2025-06-03 18:29:04] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-03 18:29:04] [INFO ] Invariant cache hit.
[2025-06-03 18:29:04] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:29:17] [INFO ] Deduced a trap composed of 5 places in 337 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 51/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63179ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 63184ms
Finished structural reductions in LTL mode , in 1 iterations and 107590 ms. Remains : 124/124 places, 1225/1225 transitions.
Built C files in :
/tmp/ltsmin5334042368373431794
[2025-06-03 18:30:07] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5334042368373431794
Running compilation step : cd /tmp/ltsmin5334042368373431794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5334042368373431794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5334042368373431794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 18:30:11] [INFO ] Flatten gal took : 108 ms
[2025-06-03 18:30:11] [INFO ] Flatten gal took : 87 ms
[2025-06-03 18:30:11] [INFO ] Time to serialize gal into /tmp/LTL11419933668307693.gal : 31 ms
[2025-06-03 18:30:11] [INFO ] Time to serialize properties into /tmp/LTL6291318110319791943.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11419933668307693.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16255102584382883032.hoa' '-atoms' '/tmp/LTL6291318110319791943.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL6291318110319791943.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16255102584382883032.hoa
Detected timeout of ITS tools.
[2025-06-03 18:30:26] [INFO ] Flatten gal took : 55 ms
[2025-06-03 18:30:26] [INFO ] Flatten gal took : 53 ms
[2025-06-03 18:30:26] [INFO ] Time to serialize gal into /tmp/LTL4747467207430705848.gal : 16 ms
[2025-06-03 18:30:26] [INFO ] Time to serialize properties into /tmp/LTL10168033105042531167.ltl : 7 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4747467207430705848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10168033105042531167.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X(X("(((((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&((NB_ATTENTE_B_8>=1)&&(ATTENTE_B>=1)))||(((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(...6040
Formula 0 simplified : FG(XX!"(((((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&((NB_ATTENTE_B_8>=1)&&(ATTENTE_B>=1)))||(((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&((NB_...6025
Detected timeout of ITS tools.
[2025-06-03 18:30:42] [INFO ] Flatten gal took : 42 ms
[2025-06-03 18:30:42] [INFO ] Applying decomposition
[2025-06-03 18:30:42] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13616617670414006029.txt' '-o' '/tmp/graph13616617670414006029.bin' '-w' '/tmp/graph13616617670414006029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13616617670414006029.bin' '-l' '-1' '-v' '-w' '/tmp/graph13616617670414006029.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:30:42] [INFO ] Decomposing Gal with order
[2025-06-03 18:30:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:30:43] [INFO ] Removed a total of 2427 redundant transitions.
[2025-06-03 18:30:43] [INFO ] Flatten gal took : 646 ms
[2025-06-03 18:30:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 34 ms.
[2025-06-03 18:30:43] [INFO ] Time to serialize gal into /tmp/LTL17586620423631102671.gal : 6 ms
[2025-06-03 18:30:43] [INFO ] Time to serialize properties into /tmp/LTL3122132345401036636.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17586620423631102671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3122132345401036636.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X(X("(((((((((i2.u1.CAPACITE>=1)&&(u2.CONTROLEUR_2>=1))&&((i2.u4.NB_ATTENTE_B_8>=1)&&(i2.u4.ATTENTE_B>=1)))||(((i2.u1.CAPACITE...7720
Formula 0 simplified : FG(XX!"(((((((((i2.u1.CAPACITE>=1)&&(u2.CONTROLEUR_2>=1))&&((i2.u4.NB_ATTENTE_B_8>=1)&&(i2.u4.ATTENTE_B>=1)))||(((i2.u1.CAPACITE>=1)...7705
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-01 finished in 360407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0&&X(G(p1))))))'
Support contains 107 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 12 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 18:30:58] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2025-06-03 18:30:58] [INFO ] Computed 5 invariants in 2 ms
[2025-06-03 18:30:58] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:31:11] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42906ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 42909ms
[2025-06-03 18:31:41] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:31:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:31:41] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-03 18:31:41] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:31:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:31:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:31:42] [INFO ] Implicit Places using invariants and state equation in 665 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 865 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1227/1228 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43800 ms. Remains : 124/126 places, 1227/1228 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 finished in 44022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p0))&&((!p1&&F(p0)) U p0))))'
Support contains 66 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 20 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 18:31:42] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:31:42] [INFO ] Invariant cache hit.
[2025-06-03 18:31:42] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:31:54] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42998ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 43002ms
[2025-06-03 18:32:25] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:32:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:32:25] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-06-03 18:32:25] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:32:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:32:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:32:27] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1453 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1227/1228 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44488 ms. Remains : 123/126 places, 1227/1228 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-04 finished in 44712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(p2)&&p1))||p0))))'
Support contains 67 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 123 transition count 1226
Applied a total of 5 rules in 200 ms. Remains 123 /126 variables (removed 3) and now considering 1226/1228 (removed 2) transitions.
[2025-06-03 18:32:27] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 123 cols
[2025-06-03 18:32:27] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:32:27] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-03 18:32:27] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-03 18:32:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:32:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:32:28] [INFO ] Implicit Places using invariants and state equation in 614 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 854 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/126 places, 1226/1228 transitions.
Applied a total of 0 rules in 141 ms. Remains 121 /121 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1196 ms. Remains : 121/126 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-06
Product exploration explored 100000 steps with 550 reset in 7043 ms.
Product exploration explored 100000 steps with 554 reset in 6894 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/121 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 297 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (121 resets) in 2938 ms. (13 steps per ms) remains 1/7 properties
BEST_FIRST walk for 1168 steps (0 resets) in 1599 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 16 factoid took 546 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 67 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 1226/1226 transitions.
Applied a total of 0 rules in 157 ms. Remains 121 /121 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2025-06-03 18:32:45] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 121 cols
[2025-06-03 18:32:45] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:32:45] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-06-03 18:32:45] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-03 18:32:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:32:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:32:46] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:32:46] [INFO ] Redundant transitions in 170 ms returned []
Running 1223 sub problems to find dead transitions.
[2025-06-03 18:32:46] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-03 18:32:46] [INFO ] Invariant cache hit.
[2025-06-03 18:32:46] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:32:57] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/367 variables, and 5 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/121 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 3 (OVERLAPS) 246/367 variables, 121/126 constraints. Problems are: Problem set: 2 solved, 1221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 20/146 constraints. Problems are: Problem set: 2 solved, 1221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 1366 constraints, problems are : Problem set: 2 solved, 1221 unsolved in 31618 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1221/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64374ms problems are : Problem set: 2 solved, 1221 unsolved
Search for dead transitions found 2 dead transitions in 64378ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 121/121 places, 1224/1226 transitions.
Applied a total of 0 rules in 95 ms. Remains 121 /121 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:33:50] [INFO ] Redundant transitions in 33 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 65767 ms. Remains : 121/121 places, 1224/1226 transitions.
Computed a total of 104 stabilizing places and 200 stable transitions
Computed a total of 104 stabilizing places and 200 stable transitions
Detected a total of 104/121 stabilizing places and 200/1224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 303 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (123 resets) in 3997 ms. (10 steps per ms) remains 1/7 properties
BEST_FIRST walk for 1168 steps (0 resets) in 96 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 16 factoid took 570 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 548 reset in 1632 ms.
Product exploration explored 100000 steps with 549 reset in 1278 ms.
Built C files in :
/tmp/ltsmin9402233343434351093
[2025-06-03 18:33:56] [INFO ] Computing symmetric may disable matrix : 1224 transitions.
[2025-06-03 18:33:56] [INFO ] Computation of Complete disable matrix. took 110 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:33:57] [INFO ] Computing symmetric may enable matrix : 1224 transitions.
[2025-06-03 18:33:57] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:33:57] [INFO ] Computing Do-Not-Accords matrix : 1224 transitions.
[2025-06-03 18:33:57] [INFO ] Computation of Completed DNA matrix. took 182 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:33:58] [INFO ] Built C files in 1361ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9402233343434351093
Running compilation step : cd /tmp/ltsmin9402233343434351093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9402233343434351093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9402233343434351093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 67 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 1224/1224 transitions.
Applied a total of 0 rules in 127 ms. Remains 121 /121 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-06-03 18:34:01] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2025-06-03 18:34:01] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:34:01] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-06-03 18:34:01] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2025-06-03 18:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:34:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:34:02] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:34:02] [INFO ] Redundant transitions in 36 ms returned []
Running 1221 sub problems to find dead transitions.
[2025-06-03 18:34:02] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2025-06-03 18:34:02] [INFO ] Invariant cache hit.
[2025-06-03 18:34:02] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:34:13] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/365 variables, and 5 constraints, problems are : Problem set: 0 solved, 1221 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/121 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1221/1220 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 3 (OVERLAPS) 244/365 variables, 121/126 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 1366 constraints, problems are : Problem set: 0 solved, 1221 unsolved in 30919 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1221/1220 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63793ms problems are : Problem set: 0 solved, 1221 unsolved
Search for dead transitions found 0 dead transitions in 63798ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65056 ms. Remains : 121/121 places, 1224/1224 transitions.
Built C files in :
/tmp/ltsmin5438442147561033396
[2025-06-03 18:35:06] [INFO ] Computing symmetric may disable matrix : 1224 transitions.
[2025-06-03 18:35:06] [INFO ] Computation of Complete disable matrix. took 107 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:35:06] [INFO ] Computing symmetric may enable matrix : 1224 transitions.
[2025-06-03 18:35:06] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:35:07] [INFO ] Computing Do-Not-Accords matrix : 1224 transitions.
[2025-06-03 18:35:07] [INFO ] Computation of Completed DNA matrix. took 112 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:35:07] [INFO ] Built C files in 1054ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5438442147561033396
Running compilation step : cd /tmp/ltsmin5438442147561033396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5438442147561033396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5438442147561033396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 18:35:10] [INFO ] Flatten gal took : 43 ms
[2025-06-03 18:35:10] [INFO ] Flatten gal took : 42 ms
[2025-06-03 18:35:10] [INFO ] Time to serialize gal into /tmp/LTL2568036889419742634.gal : 9 ms
[2025-06-03 18:35:10] [INFO ] Time to serialize properties into /tmp/LTL16045122132483918472.prop : 6 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2568036889419742634.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15936744285264786246.hoa' '-atoms' '/tmp/LTL16045122132483918472.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16045122132483918472.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15936744285264786246.hoa
Detected timeout of ITS tools.
[2025-06-03 18:35:25] [INFO ] Flatten gal took : 46 ms
[2025-06-03 18:35:25] [INFO ] Flatten gal took : 48 ms
[2025-06-03 18:35:25] [INFO ] Time to serialize gal into /tmp/LTL9715383719738005209.gal : 9 ms
[2025-06-03 18:35:25] [INFO ] Time to serialize properties into /tmp/LTL14834117304673858823.ltl : 7 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9715383719738005209.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14834117304673858823.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(((((((G(("((((((((((((NB_ATTENTE_A_32<1)||(CONTROLEUR_2<1))||((NB_ATTENTE_B_0<1)||(COMPTEUR_3<1)))&&(((NB_ATTENTE_A_35<1)||(CON...47775
Formula 0 simplified : G(F(!"((((((((((((NB_ATTENTE_A_32<1)||(CONTROLEUR_2<1))||((NB_ATTENTE_B_0<1)||(COMPTEUR_3<1)))&&(((NB_ATTENTE_A_35<1)||(CONTROLEUR_2...47752
Detected timeout of ITS tools.
[2025-06-03 18:35:40] [INFO ] Flatten gal took : 74 ms
[2025-06-03 18:35:40] [INFO ] Applying decomposition
[2025-06-03 18:35:41] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17693451261908414635.txt' '-o' '/tmp/graph17693451261908414635.bin' '-w' '/tmp/graph17693451261908414635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17693451261908414635.bin' '-l' '-1' '-v' '-w' '/tmp/graph17693451261908414635.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:35:41] [INFO ] Decomposing Gal with order
[2025-06-03 18:35:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:35:41] [INFO ] Removed a total of 2964 redundant transitions.
[2025-06-03 18:35:41] [INFO ] Flatten gal took : 310 ms
[2025-06-03 18:35:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 567 labels/synchronizations in 38 ms.
[2025-06-03 18:35:41] [INFO ] Time to serialize gal into /tmp/LTL4354395097362803269.gal : 5 ms
[2025-06-03 18:35:41] [INFO ] Time to serialize properties into /tmp/LTL15134580549023955616.ltl : 13 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4354395097362803269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15134580549023955616.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(((((((G(("((((((((((((i0.i0.u3.NB_ATTENTE_A_32<1)||(i0.i1.u27.CONTROLEUR_2<1))||((i0.i1.u27.NB_ATTENTE_B_0<1)||(i2.u8.COMPTEUR_...68102
Formula 0 simplified : G(F(!"((((((((((((i0.i0.u3.NB_ATTENTE_A_32<1)||(i0.i1.u27.CONTROLEUR_2<1))||((i0.i1.u27.NB_ATTENTE_B_0<1)||(i2.u8.COMPTEUR_3<1)))&&(...68079
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-06 finished in 209580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 52 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 121 transition count 1224
Applied a total of 9 rules in 194 ms. Remains 121 /126 variables (removed 5) and now considering 1224/1228 (removed 4) transitions.
[2025-06-03 18:35:57] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2025-06-03 18:35:57] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:35:57] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-03 18:35:57] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2025-06-03 18:35:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:35:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:35:58] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1444 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/126 places, 1224/1228 transitions.
Applied a total of 0 rules in 129 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1770 ms. Remains : 119/126 places, 1224/1228 transitions.
Stuttering acceptance computed with spot in 120 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-07
Stuttering criterion allowed to conclude after 311 steps with 0 reset in 6 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 finished in 1929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&(p1||G(p0)))) U (!p2&&X(!p0))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2025-06-03 18:35:58] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2025-06-03 18:35:58] [INFO ] Computed 5 invariants in 3 ms
[2025-06-03 18:35:58] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:36:12] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43374ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 43380ms
[2025-06-03 18:36:42] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:36:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:36:42] [INFO ] Implicit Places using invariants in 365 ms returned []
[2025-06-03 18:36:42] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:36:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:36:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:36:44] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2136 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45542 ms. Remains : 124/126 places, 1228/1228 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR p2 p0), (NOT p0), false, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 620 ms.
Product exploration explored 100000 steps with 50000 reset in 746 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 24 factoid took 1754 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-08 finished in 48919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(G((p1&&X(p1))))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2025-06-03 18:36:47] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:36:47] [INFO ] Invariant cache hit.
[2025-06-03 18:36:47] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:37:01] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 19)
(s55 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43129ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 43135ms
[2025-06-03 18:37:30] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:37:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:37:31] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-06-03 18:37:31] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:37:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:37:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:37:32] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1757 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44921 ms. Remains : 124/126 places, 1228/1228 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-09 finished in 45101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(p1)))||G(p2)||F(p3))))'
Support contains 9 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2025-06-03 18:37:32] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:37:32] [INFO ] Invariant cache hit.
[2025-06-03 18:37:32] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:37:46] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43281ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 43284ms
[2025-06-03 18:38:16] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:38:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:38:16] [INFO ] Implicit Places using invariants in 482 ms returned []
[2025-06-03 18:38:16] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:38:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:38:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:38:18] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2077 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 13 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45385 ms. Remains : 125/126 places, 1228/1228 transitions.
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-11
Product exploration explored 100000 steps with 1886 reset in 827 ms.
Product exploration explored 100000 steps with 1890 reset in 550 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/125 stabilizing places and 204/1228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 246 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p3) (NOT p2))]
RANDOM walk for 40001 steps (88 resets) in 453 ms. (88 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
[2025-06-03 18:38:20] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 125 cols
[2025-06-03 18:38:20] [INFO ] Computed 5 invariants in 2 ms
[2025-06-03 18:38:20] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 7/373 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p2) p3 p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p2), (F p3), (F p0), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F p1)]
Knowledge based reduction with 11 factoid took 744 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
[2025-06-03 18:38:22] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:38:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:38:23] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2025-06-03 18:38:23] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2025-06-03 18:38:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:38:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2025-06-03 18:38:24] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2025-06-03 18:38:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:38:24] [INFO ] [Nat]Added 20 Read/Feed constraints in 118 ms returned sat
[2025-06-03 18:38:24] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 135 transitions) in 41 ms.
[2025-06-03 18:38:26] [INFO ] Added : 59 causal constraints over 14 iterations in 1647 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3) (NOT p1))
Support contains 8 out of 125 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1228/1228 transitions.
Applied a total of 0 rules in 12 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2025-06-03 18:38:26] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:38:26] [INFO ] Invariant cache hit.
[2025-06-03 18:38:26] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:38:37] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 51/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43225ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 43234ms
[2025-06-03 18:39:09] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:39:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:39:10] [INFO ] Implicit Places using invariants in 479 ms returned []
[2025-06-03 18:39:10] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:39:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:39:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:39:11] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
Running 1225 sub problems to find dead transitions.
[2025-06-03 18:39:11] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:39:11] [INFO ] Invariant cache hit.
[2025-06-03 18:39:11] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:39:23] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/373 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 1323 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 31952 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64589ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 64594ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 125/125 places, 1226/1228 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110234 ms. Remains : 125/125 places, 1226/1228 transitions.
Computed a total of 108 stabilizing places and 202 stable transitions
Computed a total of 108 stabilizing places and 202 stable transitions
Detected a total of 108/125 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
RANDOM walk for 11400 steps (24 resets) in 87 ms. (129 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p3) (NOT p0)))), (F p0), (F p3)]
Knowledge based reduction with 4 factoid took 342 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
[2025-06-03 18:40:17] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 125 cols
[2025-06-03 18:40:17] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:40:18] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2025-06-03 18:40:18] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2025-06-03 18:40:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:40:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2025-06-03 18:40:20] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2025-06-03 18:40:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:40:20] [INFO ] [Nat]Added 20 Read/Feed constraints in 220 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:40:20] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:40:21] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 7 ms to minimize.
[2025-06-03 18:40:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1972 ms
[2025-06-03 18:40:22] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 42 ms.
[2025-06-03 18:40:24] [INFO ] Added : 55 causal constraints over 13 iterations in 2064 ms. Result :sat
Could not prove EG (AND (NOT p3) (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Product exploration explored 100000 steps with 1896 reset in 727 ms.
Product exploration explored 100000 steps with 1883 reset in 525 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Support contains 8 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1225
Applied a total of 2 rules in 139 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2025-06-03 18:40:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2025-06-03 18:40:26] [INFO ] Computed 6 invariants in 3 ms
[2025-06-03 18:40:26] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:40:37] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 51/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43291ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 43297ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:41:09] [INFO ] Redundant transitions in 37 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-03 18:41:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-03 18:41:09] [INFO ] Invariant cache hit.
[2025-06-03 18:41:09] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:41:21] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1322 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31657 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65183ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65189ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/125 places, 1225/1226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108684 ms. Remains : 124/125 places, 1225/1226 transitions.
Built C files in :
/tmp/ltsmin715460169444819083
[2025-06-03 18:42:14] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin715460169444819083
Running compilation step : cd /tmp/ltsmin715460169444819083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin715460169444819083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin715460169444819083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 8 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1225
Applied a total of 2 rules in 23 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2025-06-03 18:42:17] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-03 18:42:17] [INFO ] Invariant cache hit.
[2025-06-03 18:42:17] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:42:31] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 51/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43293ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 43298ms
[2025-06-03 18:43:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-03 18:43:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:43:01] [INFO ] Implicit Places using invariants in 478 ms returned []
[2025-06-03 18:43:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-03 18:43:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:43:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:43:02] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2025-06-03 18:43:02] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-06-03 18:43:02] [INFO ] Invariant cache hit.
[2025-06-03 18:43:02] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:43:16] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 62904ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 62910ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 1225/1226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107987 ms. Remains : 124/125 places, 1225/1226 transitions.
Built C files in :
/tmp/ltsmin14764419275689278332
[2025-06-03 18:44:05] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14764419275689278332
Running compilation step : cd /tmp/ltsmin14764419275689278332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14764419275689278332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14764419275689278332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 18:44:09] [INFO ] Flatten gal took : 41 ms
[2025-06-03 18:44:09] [INFO ] Flatten gal took : 42 ms
[2025-06-03 18:44:09] [INFO ] Time to serialize gal into /tmp/LTL4505686168555623885.gal : 9 ms
[2025-06-03 18:44:09] [INFO ] Time to serialize properties into /tmp/LTL6768490775619920192.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4505686168555623885.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16653751748990277838.hoa' '-atoms' '/tmp/LTL6768490775619920192.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6768490775619920192.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16653751748990277838.hoa
Detected timeout of ITS tools.
[2025-06-03 18:44:24] [INFO ] Flatten gal took : 37 ms
[2025-06-03 18:44:24] [INFO ] Flatten gal took : 38 ms
[2025-06-03 18:44:24] [INFO ] Time to serialize gal into /tmp/LTL1030830880411662208.gal : 9 ms
[2025-06-03 18:44:24] [INFO ] Time to serialize properties into /tmp/LTL18116619675463138183.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1030830880411662208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18116619675463138183.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((X(X(X("((ROUTE_A>=1)&&(NB_ATTENTE_A_43>=1))"))))||(G("((((SUR_PONT_A>=1)&&(NB_ATTENTE_A_27>=1))&&((ATTENTE_A>=1)&&(CAPACITE>=1)...308
Formula 0 simplified : F(!"(((NB_ATTENTE_A_27>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))" & XXX!"((ROUTE_A>=1)&&(NB_ATTENTE_A_43>=1))" & F!"...290
Detected timeout of ITS tools.
[2025-06-03 18:44:39] [INFO ] Flatten gal took : 33 ms
[2025-06-03 18:44:39] [INFO ] Applying decomposition
[2025-06-03 18:44:39] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1861896589507624283.txt' '-o' '/tmp/graph1861896589507624283.bin' '-w' '/tmp/graph1861896589507624283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1861896589507624283.bin' '-l' '-1' '-v' '-w' '/tmp/graph1861896589507624283.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:44:39] [INFO ] Decomposing Gal with order
[2025-06-03 18:44:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:44:40] [INFO ] Removed a total of 2475 redundant transitions.
[2025-06-03 18:44:40] [INFO ] Flatten gal took : 450 ms
[2025-06-03 18:44:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 20 ms.
[2025-06-03 18:44:40] [INFO ] Time to serialize gal into /tmp/LTL14683941090662248723.gal : 2 ms
[2025-06-03 18:44:40] [INFO ] Time to serialize properties into /tmp/LTL2635241848840848668.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14683941090662248723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2635241848840848668.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(((X(X(X("((i0.u0.ROUTE_A>=1)&&(i2.u1.NB_ATTENTE_A_43>=1))"))))||(G("((((i0.u0.SUR_PONT_A>=1)&&(i2.u1.NB_ATTENTE_A_27>=1))&&((i0.u...380
Formula 0 simplified : F(!"(((i2.u1.NB_ATTENTE_A_27>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u2.CAPACITE>=1)&&(u3.CONTROLEUR_1>=1)))" & XXX!"((i0.u0.ROUTE_A>=1)&&(...362
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-11 finished in 442411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(((p1 U p0)||(p1&&G(p2)))))))'
Support contains 8 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2025-06-03 18:44:55] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2025-06-03 18:44:55] [INFO ] Computed 5 invariants in 3 ms
[2025-06-03 18:44:55] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:45:07] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42958ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 42961ms
[2025-06-03 18:45:38] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:45:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:45:38] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-06-03 18:45:38] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:45:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:45:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:45:39] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
Running 1225 sub problems to find dead transitions.
[2025-06-03 18:45:39] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 18:45:39] [INFO ] Invariant cache hit.
[2025-06-03 18:45:39] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:45:52] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1274 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 31643 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64881ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 64885ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 126/126 places, 1226/1228 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109326 ms. Remains : 126/126 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 406 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-13 finished in 109767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 152 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 18:46:45] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2025-06-03 18:46:45] [INFO ] Computed 5 invariants in 4 ms
[2025-06-03 18:46:45] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:46:57] [INFO ] Deduced a trap composed of 5 places in 349 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 51/1173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43005ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 43012ms
[2025-06-03 18:47:28] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:47:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:47:28] [INFO ] Implicit Places using invariants in 537 ms returned []
[2025-06-03 18:47:28] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:47:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:47:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:47:30] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2233 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/126 places, 1227/1228 transitions.
Applied a total of 0 rules in 103 ms. Remains 123 /123 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45510 ms. Remains : 123/126 places, 1227/1228 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-14
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-14 finished in 45666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&F((X(G(!p1))&&(!p2 U (p3||G(!p2)))))) U X(p4)))'
Support contains 14 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1227
Applied a total of 2 rules in 22 ms. Remains 125 /126 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 18:47:30] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2025-06-03 18:47:30] [INFO ] Computed 5 invariants in 2 ms
[2025-06-03 18:47:30] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:47:43] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
SMT process timed out in 43145ms, After SMT, problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 43151ms
[2025-06-03 18:48:13] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:48:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:48:14] [INFO ] Implicit Places using invariants in 327 ms returned []
[2025-06-03 18:48:14] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:48:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:48:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 18:48:15] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
Running 1224 sub problems to find dead transitions.
[2025-06-03 18:48:15] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 18:48:15] [INFO ] Invariant cache hit.
[2025-06-03 18:48:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:48:26] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1272 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 31464 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64584ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 64588ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 125/126 places, 1225/1228 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109064 ms. Remains : 125/126 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 416 ms :[(NOT p4), (AND p1 (NOT p4)), (AND (NOT p3) p2 (NOT p4) (NOT p1)), (NOT p4), (OR (AND p2 (NOT p3) (NOT p4)) (AND p1 (NOT p4))), true, (OR p1 (AND p2 (NOT p3))), p1, (AND p2 (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1267 steps with 3 reset in 11 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 finished in 109544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(p0))&&(G(!p1) U p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(p2)&&p1))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(p1)))||G(p2)||F(p3))))'
[2025-06-03 18:49:20] [INFO ] Flatten gal took : 50 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2826997520760200965
[2025-06-03 18:49:20] [INFO ] Computing symmetric may disable matrix : 1228 transitions.
[2025-06-03 18:49:20] [INFO ] Applying decomposition
[2025-06-03 18:49:20] [INFO ] Computation of Complete disable matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:49:20] [INFO ] Flatten gal took : 51 ms
[2025-06-03 18:49:20] [INFO ] Computing symmetric may enable matrix : 1228 transitions.
[2025-06-03 18:49:20] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9808283421086680499.txt' '-o' '/tmp/graph9808283421086680499.bin' '-w' '/tmp/graph9808283421086680499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9808283421086680499.bin' '-l' '-1' '-v' '-w' '/tmp/graph9808283421086680499.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:49:21] [INFO ] Decomposing Gal with order
[2025-06-03 18:49:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:49:21] [INFO ] Removed a total of 2723 redundant transitions.
[2025-06-03 18:49:21] [INFO ] Flatten gal took : 259 ms
[2025-06-03 18:49:21] [INFO ] Computing Do-Not-Accords matrix : 1228 transitions.
[2025-06-03 18:49:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 383 labels/synchronizations in 29 ms.
[2025-06-03 18:49:21] [INFO ] Time to serialize gal into /tmp/LTLFireability11046795139871853593.gal : 2 ms
[2025-06-03 18:49:21] [INFO ] Time to serialize properties into /tmp/LTLFireability9684642910170587419.ltl : 8 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11046795139871853593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9684642910170587419.ltl' '-c' '-stutter-deadlock'
[2025-06-03 18:49:21] [INFO ] Computation of Completed DNA matrix. took 95 ms. Total solver calls (SAT/UNSAT): 0(0/0)
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(F((X(X("(((((((((u4.CAPACITE>=1)&&(i0.u3.CONTROLEUR_2>=1))&&((i1.u0.NB_ATTENTE_B_8>=1)&&(u4.ATTENTE_B>=1)))||(((u4.CAPACITE>=1)&&...7165
Formula 0 simplified : FG(XX!"(((((((((u4.CAPACITE>=1)&&(i0.u3.CONTROLEUR_2>=1))&&((i1.u0.NB_ATTENTE_B_8>=1)&&(u4.ATTENTE_B>=1)))||(((u4.CAPACITE>=1)&&(i0....7150
[2025-06-03 18:49:21] [INFO ] Built C files in 742ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2826997520760200965
Running compilation step : cd /tmp/ltsmin2826997520760200965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 10740 ms.
Running link step : cd /tmp/ltsmin2826997520760200965;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 133 ms.
Running LTSmin : cd /tmp/ltsmin2826997520760200965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X(X((LTLAPp0==true)))&&([](!(LTLAPp1==true)) U (LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 1149 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2826997520760200965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((<>((LTLAPp5==true))&&(LTLAPp4==true)))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2826997520760200965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((<>((LTLAPp5==true))&&(LTLAPp4==true)))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2826997520760200965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp6==true)||X(X(X((LTLAPp7==true))))||[]((LTLAPp8==true))||<>((LTLAPp9==true))))' '--buchi-type=spotba'
LTSmin run took 264855 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin2826997520760200965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((<>((LTLAPp5==true))&&(LTLAPp4==true)))||(LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-03 19:18:04] [INFO ] Flatten gal took : 143 ms
[2025-06-03 19:18:04] [INFO ] Time to serialize gal into /tmp/LTLFireability3042862937940015016.gal : 17 ms
[2025-06-03 19:18:04] [INFO ] Time to serialize properties into /tmp/LTLFireability17047418829129858919.ltl : 10 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3042862937940015016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17047418829129858919.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((ROUTE_A>=1)&&(NB_ATTENTE_A_20>=1))||((ROUTE_A>=1)&&(NB_ATTENTE_A_22>=1)))||(((ROUTE_A>=1)&&(NB_ATTENTE_A_16>=1))||((RO...47767
Formula 0 simplified : G(F(!"((((((((((((NB_ATTENTE_A_32<1)||(CONTROLEUR_2<1))||((NB_ATTENTE_B_0<1)||(COMPTEUR_3<1)))&&(((NB_ATTENTE_A_35<1)||(CONTROLEUR_2...47748
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="BridgeAndVehicles-PT-V50P20N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V50P20N10, 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 r016-smll-174853765000388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 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.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 ;