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 | T??T?T?????FFF?T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765000385.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765000385
=====================================================================
--------------------
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-CTLCardinality-2025-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748970479201
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202505121319
[2025-06-03 17:08:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 17:08:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 17:08:01] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2025-06-03 17:08:01] [INFO ] Transformed 128 places.
[2025-06-03 17:08:01] [INFO ] Transformed 1328 transitions.
[2025-06-03 17:08:01] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 50 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2025-06-03 17:08:01] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2025-06-03 17:08:01] [INFO ] Computed 7 invariants in 35 ms
[2025-06-03 17:08:02] [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 17:08:14] [INFO ] Deduced a trap composed of 5 places in 383 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:21] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 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/378 variables, and 7 constraints, problems are : Problem set: 50 solved, 1275 unsolved in 20136 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 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
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/9 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/378 variables, and 9 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 151/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44024ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 44088ms
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 17:08:45] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 128 cols
[2025-06-03 17:08:45] [INFO ] Computed 7 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:08:46] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-06-03 17:08:46] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 17:08:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:08:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 17:08:46] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 22 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45179 ms. Remains : 128/128 places, 1228/1328 transitions.
Support contains 60 out of 128 places after structural reductions.
[2025-06-03 17:08:47] [INFO ] Flatten gal took : 171 ms
[2025-06-03 17:08:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 17:08:47] [INFO ] Flatten gal took : 119 ms
[2025-06-03 17:08:47] [INFO ] Input system was already deterministic with 1228 transitions.
RANDOM walk for 40002 steps (88 resets) in 2664 ms. (15 steps per ms) remains 38/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
[2025-06-03 17:08:49] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 17:08:49] [INFO ] Invariant cache hit.
[2025-06-03 17:08:49] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp59 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 3/3 constraints. Problems are: Problem set: 15 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 15 solved, 23 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 2 (OVERLAPS) 85/128 variables, 4/7 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 248/376 variables, 128/135 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 20/155 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/155 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/376 variables, 0/155 constraints. Problems are: Problem set: 37 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 155 constraints, problems are : Problem set: 37 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 37 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: 37 solved, 1 unsolved
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Int declared 102/376 variables, and 2 constraints, problems are : Problem set: 38 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 2/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 477ms problems are : Problem set: 38 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 38 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 17:08:49] [INFO ] Flatten gal took : 70 ms
[2025-06-03 17:08:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 17:08:49] [INFO ] Flatten gal took : 72 ms
[2025-06-03 17:08:49] [INFO ] Input system was already deterministic with 1228 transitions.
Support contains 23 out of 128 places (down from 29) after GAL structural reductions.
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1228
Applied a total of 1 rules in 33 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2025-06-03 17:08:50] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 127 cols
[2025-06-03 17:08:50] [INFO ] Computed 6 invariants in 10 ms
[2025-06-03 17:08: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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 17:08:59] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 6 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/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 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
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 127/375 variables, and 7 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42736ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 42745ms
[2025-06-03 17:09:32] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 17:09:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:09:33] [INFO ] Implicit Places using invariants in 331 ms returned []
[2025-06-03 17:09:33] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 17:09:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:09:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 17:09:34] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1435 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 14 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44232 ms. Remains : 126/128 places, 1228/1228 transitions.
[2025-06-03 17:09:34] [INFO ] Flatten gal took : 49 ms
[2025-06-03 17:09:34] [INFO ] Flatten gal took : 55 ms
[2025-06-03 17:09:34] [INFO ] Input system was already deterministic with 1228 transitions.
[2025-06-03 17:09:34] [INFO ] Flatten gal took : 53 ms
[2025-06-03 17:09:34] [INFO ] Flatten gal took : 52 ms
[2025-06-03 17:09:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality12845348614256809052.gal : 40 ms
[2025-06-03 17:09:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality12923973715319748992.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12845348614256809052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12923973715319748992.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:10:04] [INFO ] Flatten gal took : 44 ms
[2025-06-03 17:10:04] [INFO ] Applying decomposition
[2025-06-03 17:10:04] [INFO ] Flatten gal took : 48 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/graph7072397598092809150.txt' '-o' '/tmp/graph7072397598092809150.bin' '-w' '/tmp/graph7072397598092809150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7072397598092809150.bin' '-l' '-1' '-v' '-w' '/tmp/graph7072397598092809150.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:10:05] [INFO ] Decomposing Gal with order
[2025-06-03 17:10:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:10:07] [INFO ] Removed a total of 2495 redundant transitions.
[2025-06-03 17:10:07] [INFO ] Flatten gal took : 1969 ms
[2025-06-03 17:10:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1161 labels/synchronizations in 127 ms.
[2025-06-03 17:10:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality2746411283159444163.gal : 14 ms
[2025-06-03 17:10:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality2482464279329897427.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2746411283159444163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2482464279329897427.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1228
Applied a total of 1 rules in 16 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2025-06-03 17:10:37] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 17:10:37] [INFO ] Invariant cache hit.
[2025-06-03 17:10:37] [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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 17:10:47] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 5 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/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 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
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 127/375 variables, and 7 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43244ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 43250ms
[2025-06-03 17:11:20] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 17:11:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:11:21] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-06-03 17:11:21] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2025-06-03 17:11:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:11:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 17:11:22] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1592 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 10 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 44873 ms. Remains : 125/128 places, 1228/1228 transitions.
[2025-06-03 17:11:22] [INFO ] Flatten gal took : 81 ms
[2025-06-03 17:11:22] [INFO ] Flatten gal took : 122 ms
[2025-06-03 17:11:22] [INFO ] Input system was already deterministic with 1228 transitions.
[2025-06-03 17:11:23] [INFO ] Flatten gal took : 78 ms
[2025-06-03 17:11:23] [INFO ] Flatten gal took : 75 ms
[2025-06-03 17:11:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality9767626650017241206.gal : 10 ms
[2025-06-03 17:11:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality15534919131245344499.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9767626650017241206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15534919131245344499.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:11:53] [INFO ] Flatten gal took : 47 ms
[2025-06-03 17:11:53] [INFO ] Applying decomposition
[2025-06-03 17:11:53] [INFO ] Flatten gal took : 46 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/graph2895250310315911161.txt' '-o' '/tmp/graph2895250310315911161.bin' '-w' '/tmp/graph2895250310315911161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2895250310315911161.bin' '-l' '-1' '-v' '-w' '/tmp/graph2895250310315911161.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:11:53] [INFO ] Decomposing Gal with order
[2025-06-03 17:11:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:11:53] [INFO ] Removed a total of 2933 redundant transitions.
[2025-06-03 17:11:53] [INFO ] Flatten gal took : 260 ms
[2025-06-03 17:11:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 424 labels/synchronizations in 28 ms.
[2025-06-03 17:11:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality13256420016466547994.gal : 6 ms
[2025-06-03 17:11:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10785191171232378292.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13256420016466547994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10785191171232378292.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 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 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 33 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 17:12:24] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2025-06-03 17:12:24] [INFO ] Computed 5 invariants in 4 ms
[2025-06-03 17:12:24] [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 17:12:33] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 5 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 20028 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
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 21616 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 44250ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 44256ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2025-06-03 17:13:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2025-06-03 17:13:08] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:13:09] [INFO ] Implicit Places using invariants in 682 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 688 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 34 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45023 ms. Remains : 123/128 places, 1225/1228 transitions.
[2025-06-03 17:13:09] [INFO ] Flatten gal took : 73 ms
[2025-06-03 17:13:09] [INFO ] Flatten gal took : 90 ms
[2025-06-03 17:13:09] [INFO ] Input system was already deterministic with 1225 transitions.
[2025-06-03 17:13:09] [INFO ] Flatten gal took : 104 ms
[2025-06-03 17:13:09] [INFO ] Flatten gal took : 77 ms
[2025-06-03 17:13:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality243525615602746472.gal : 10 ms
[2025-06-03 17:13:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality642915018478879593.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality243525615602746472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality642915018478879593.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:13:39] [INFO ] Flatten gal took : 40 ms
[2025-06-03 17:13:39] [INFO ] Applying decomposition
[2025-06-03 17:13:39] [INFO ] Flatten gal took : 45 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/graph12854756306130512784.txt' '-o' '/tmp/graph12854756306130512784.bin' '-w' '/tmp/graph12854756306130512784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12854756306130512784.bin' '-l' '-1' '-v' '-w' '/tmp/graph12854756306130512784.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:13:40] [INFO ] Decomposing Gal with order
[2025-06-03 17:13:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:13:40] [INFO ] Removed a total of 2786 redundant transitions.
[2025-06-03 17:13:40] [INFO ] Flatten gal took : 324 ms
[2025-06-03 17:13:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 454 labels/synchronizations in 57 ms.
[2025-06-03 17:13:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality9692510129439176595.gal : 3 ms
[2025-06-03 17:13:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality6493480634970090111.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9692510129439176595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6493480634970090111.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 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 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 28 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 17:14:10] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2025-06-03 17:14:10] [INFO ] Computed 5 invariants in 2 ms
[2025-06-03 17:14:10] [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 17:14:20] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 5 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 20027 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
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
SMT process timed out in 42964ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 42971ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2025-06-03 17:14:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2025-06-03 17:14:53] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:14:54] [INFO ] Implicit Places using invariants in 406 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 430 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 9 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 43446 ms. Remains : 124/128 places, 1225/1228 transitions.
[2025-06-03 17:14:54] [INFO ] Flatten gal took : 34 ms
[2025-06-03 17:14:54] [INFO ] Flatten gal took : 46 ms
[2025-06-03 17:14:54] [INFO ] Input system was already deterministic with 1225 transitions.
[2025-06-03 17:14:54] [INFO ] Flatten gal took : 85 ms
[2025-06-03 17:14:54] [INFO ] Flatten gal took : 55 ms
[2025-06-03 17:14:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality15216210772304606149.gal : 24 ms
[2025-06-03 17:14:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality3805806239554745303.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15216210772304606149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3805806239554745303.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:15:24] [INFO ] Flatten gal took : 63 ms
[2025-06-03 17:15:24] [INFO ] Applying decomposition
[2025-06-03 17:15:24] [INFO ] Flatten gal took : 39 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/graph11639083700674287429.txt' '-o' '/tmp/graph11639083700674287429.bin' '-w' '/tmp/graph11639083700674287429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11639083700674287429.bin' '-l' '-1' '-v' '-w' '/tmp/graph11639083700674287429.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:15:24] [INFO ] Decomposing Gal with order
[2025-06-03 17:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:15:25] [INFO ] Removed a total of 2570 redundant transitions.
[2025-06-03 17:15:25] [INFO ] Flatten gal took : 425 ms
[2025-06-03 17:15:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 429 labels/synchronizations in 30 ms.
[2025-06-03 17:15:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality12469022351012794445.gal : 2 ms
[2025-06-03 17:15:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality13451346734947809331.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12469022351012794445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13451346734947809331.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 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 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 15 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 17:15:55] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2025-06-03 17:15:55] [INFO ] Computed 5 invariants in 2 ms
[2025-06-03 17:15: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/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 17:16:05] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 5 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 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
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 20026 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 43036ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 43040ms
[2025-06-03 17:16:38] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 17:16:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:16:38] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-06-03 17:16:38] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 17:16:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:16:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 17:16:40] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1659 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 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 44725 ms. Remains : 123/128 places, 1227/1228 transitions.
[2025-06-03 17:16:40] [INFO ] Flatten gal took : 31 ms
[2025-06-03 17:16:40] [INFO ] Flatten gal took : 37 ms
[2025-06-03 17:16:40] [INFO ] Input system was already deterministic with 1227 transitions.
[2025-06-03 17:16:40] [INFO ] Flatten gal took : 36 ms
[2025-06-03 17:16:40] [INFO ] Flatten gal took : 37 ms
[2025-06-03 17:16:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality8068692696202214523.gal : 10 ms
[2025-06-03 17:16:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5792079754963570071.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8068692696202214523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5792079754963570071.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:17:10] [INFO ] Flatten gal took : 36 ms
[2025-06-03 17:17:10] [INFO ] Applying decomposition
[2025-06-03 17:17:10] [INFO ] Flatten gal took : 37 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/graph15220509911109704664.txt' '-o' '/tmp/graph15220509911109704664.bin' '-w' '/tmp/graph15220509911109704664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15220509911109704664.bin' '-l' '-1' '-v' '-w' '/tmp/graph15220509911109704664.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:17:10] [INFO ] Decomposing Gal with order
[2025-06-03 17:17:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:17:10] [INFO ] Removed a total of 3151 redundant transitions.
[2025-06-03 17:17:10] [INFO ] Flatten gal took : 148 ms
[2025-06-03 17:17:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 411 labels/synchronizations in 17 ms.
[2025-06-03 17:17:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality17755128653511679929.gal : 3 ms
[2025-06-03 17:17:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality13366663106597354469.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17755128653511679929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13366663106597354469.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 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 6 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 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 304 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
[2025-06-03 17:17:41] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2025-06-03 17:17:41] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:17:41] [INFO ] Implicit Places using invariants in 549 ms returned []
[2025-06-03 17:17:41] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2025-06-03 17:17:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:17:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 17:17:42] [INFO ] Implicit Places using invariants and state equation in 943 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1514 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 119/128 places, 1224/1228 transitions.
Applied a total of 0 rules in 92 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1912 ms. Remains : 119/128 places, 1224/1228 transitions.
[2025-06-03 17:17:43] [INFO ] Flatten gal took : 28 ms
[2025-06-03 17:17:43] [INFO ] Flatten gal took : 34 ms
[2025-06-03 17:17:43] [INFO ] Input system was already deterministic with 1224 transitions.
[2025-06-03 17:17:43] [INFO ] Flatten gal took : 32 ms
[2025-06-03 17:17:43] [INFO ] Flatten gal took : 34 ms
[2025-06-03 17:17:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10791478250067110148.gal : 8 ms
[2025-06-03 17:17:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality15569926706708123430.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10791478250067110148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15569926706708123430.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:18:13] [INFO ] Flatten gal took : 33 ms
[2025-06-03 17:18:13] [INFO ] Applying decomposition
[2025-06-03 17:18:13] [INFO ] Flatten gal took : 34 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/graph17926435295080631314.txt' '-o' '/tmp/graph17926435295080631314.bin' '-w' '/tmp/graph17926435295080631314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17926435295080631314.bin' '-l' '-1' '-v' '-w' '/tmp/graph17926435295080631314.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:18:13] [INFO ] Decomposing Gal with order
[2025-06-03 17:18:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:18:13] [INFO ] Removed a total of 1022 redundant transitions.
[2025-06-03 17:18:13] [INFO ] Flatten gal took : 119 ms
[2025-06-03 17:18:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 5 ms.
[2025-06-03 17:18:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality14071644144994118540.gal : 5 ms
[2025-06-03 17:18:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14271364998967085120.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14071644144994118540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14271364998967085120.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 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 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 16 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 17:18:43] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2025-06-03 17:18:43] [INFO ] Computed 5 invariants in 2 ms
[2025-06-03 17:18:43] [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 17:18:53] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 5 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 20044 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
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
SMT process timed out in 43185ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 43190ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2025-06-03 17:19:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2025-06-03 17:19:26] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:19:27] [INFO ] Implicit Places using invariants in 410 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 430 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43647 ms. Remains : 123/128 places, 1225/1228 transitions.
[2025-06-03 17:19:27] [INFO ] Flatten gal took : 29 ms
[2025-06-03 17:19:27] [INFO ] Flatten gal took : 35 ms
[2025-06-03 17:19:27] [INFO ] Input system was already deterministic with 1225 transitions.
[2025-06-03 17:19:27] [INFO ] Flatten gal took : 34 ms
[2025-06-03 17:19:27] [INFO ] Flatten gal took : 35 ms
[2025-06-03 17:19:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality17663694160237306050.gal : 10 ms
[2025-06-03 17:19:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality18091237301705158279.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17663694160237306050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18091237301705158279.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:19:57] [INFO ] Flatten gal took : 36 ms
[2025-06-03 17:19:57] [INFO ] Applying decomposition
[2025-06-03 17:19:57] [INFO ] Flatten gal took : 36 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/graph1244198119449609011.txt' '-o' '/tmp/graph1244198119449609011.bin' '-w' '/tmp/graph1244198119449609011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1244198119449609011.bin' '-l' '-1' '-v' '-w' '/tmp/graph1244198119449609011.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:19:57] [INFO ] Decomposing Gal with order
[2025-06-03 17:19:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:19:58] [INFO ] Removed a total of 1647 redundant transitions.
[2025-06-03 17:19:58] [INFO ] Flatten gal took : 201 ms
[2025-06-03 17:19:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 23 ms.
[2025-06-03 17:19:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality17439025419900590967.gal : 5 ms
[2025-06-03 17:19:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality2876066246182810543.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17439025419900590967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2876066246182810543.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 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 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 13 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 17:20:28] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2025-06-03 17:20:28] [INFO ] Computed 5 invariants in 2 ms
[2025-06-03 17:20:28] [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 17:20:38] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 5 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 20041 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
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
SMT process timed out in 42995ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 42998ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2025-06-03 17:21:11] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2025-06-03 17:21:11] [INFO ] Computed 7 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:21:11] [INFO ] Implicit Places using invariants in 472 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 488 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43510 ms. Remains : 123/128 places, 1225/1228 transitions.
[2025-06-03 17:21:11] [INFO ] Flatten gal took : 29 ms
[2025-06-03 17:21:11] [INFO ] Flatten gal took : 35 ms
[2025-06-03 17:21:12] [INFO ] Input system was already deterministic with 1225 transitions.
[2025-06-03 17:21:12] [INFO ] Flatten gal took : 34 ms
[2025-06-03 17:21:12] [INFO ] Flatten gal took : 35 ms
[2025-06-03 17:21:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality13066729292600545693.gal : 8 ms
[2025-06-03 17:21:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality8187893302379845707.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13066729292600545693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8187893302379845707.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:21:42] [INFO ] Flatten gal took : 35 ms
[2025-06-03 17:21:42] [INFO ] Applying decomposition
[2025-06-03 17:21:42] [INFO ] Flatten gal took : 36 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/graph11440748450348277119.txt' '-o' '/tmp/graph11440748450348277119.bin' '-w' '/tmp/graph11440748450348277119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11440748450348277119.bin' '-l' '-1' '-v' '-w' '/tmp/graph11440748450348277119.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:21:42] [INFO ] Decomposing Gal with order
[2025-06-03 17:21:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:21:42] [INFO ] Removed a total of 1280 redundant transitions.
[2025-06-03 17:21:42] [INFO ] Flatten gal took : 216 ms
[2025-06-03 17:21:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 337 labels/synchronizations in 9 ms.
[2025-06-03 17:21:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality108925246308895709.gal : 5 ms
[2025-06-03 17:21:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality15250443954187215889.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality108925246308895709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15250443954187215889.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 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 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 15 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 17:22:12] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2025-06-03 17:22:12] [INFO ] Computed 5 invariants in 2 ms
[2025-06-03 17:22: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 17:22:22] [INFO ] Deduced a trap composed of 5 places in 250 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 20030 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 20046 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 43208ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 43212ms
[2025-06-03 17:22:56] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 17:22:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:22:56] [INFO ] Implicit Places using invariants in 490 ms returned []
[2025-06-03 17:22:56] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 17:22:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:22:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 17:22:58] [INFO ] Implicit Places using invariants and state equation in 1951 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2472 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1227/1228 transitions.
Applied a total of 0 rules in 9 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 45711 ms. Remains : 123/128 places, 1227/1228 transitions.
[2025-06-03 17:22:58] [INFO ] Flatten gal took : 38 ms
[2025-06-03 17:22:58] [INFO ] Flatten gal took : 44 ms
[2025-06-03 17:22:58] [INFO ] Input system was already deterministic with 1227 transitions.
[2025-06-03 17:22:58] [INFO ] Flatten gal took : 56 ms
[2025-06-03 17:22:58] [INFO ] Flatten gal took : 57 ms
[2025-06-03 17:22:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality16298940406108449355.gal : 12 ms
[2025-06-03 17:22:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality352049677678343430.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16298940406108449355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality352049677678343430.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:23:29] [INFO ] Flatten gal took : 57 ms
[2025-06-03 17:23:29] [INFO ] Applying decomposition
[2025-06-03 17:23:29] [INFO ] Flatten gal took : 56 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/graph895627562896003665.txt' '-o' '/tmp/graph895627562896003665.bin' '-w' '/tmp/graph895627562896003665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph895627562896003665.bin' '-l' '-1' '-v' '-w' '/tmp/graph895627562896003665.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:23:29] [INFO ] Decomposing Gal with order
[2025-06-03 17:23:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:23:29] [INFO ] Removed a total of 2134 redundant transitions.
[2025-06-03 17:23:29] [INFO ] Flatten gal took : 457 ms
[2025-06-03 17:23:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 285 labels/synchronizations in 12 ms.
[2025-06-03 17:23:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality556591420210758411.gal : 4 ms
[2025-06-03 17:23:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality1835254372143274676.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality556591420210758411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1835254372143274676.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 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 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 14 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2025-06-03 17:23:59] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 17:23:59] [INFO ] Invariant cache hit.
[2025-06-03 17:23:59] [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 17:24:13] [INFO ] Deduced a trap composed of 5 places in 324 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 20046 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 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 43185ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 43188ms
[2025-06-03 17:24:43] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 17:24:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:24:43] [INFO ] Implicit Places using invariants in 550 ms returned []
[2025-06-03 17:24:43] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-03 17:24:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:24:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 17:24:45] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2717 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1227/1228 transitions.
Applied a total of 0 rules in 10 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 45932 ms. Remains : 123/128 places, 1227/1228 transitions.
[2025-06-03 17:24:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-03 17:24:45] [INFO ] Flatten gal took : 44 ms
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 17:24:45] [INFO ] Flatten gal took : 51 ms
[2025-06-03 17:24:45] [INFO ] Input system was already deterministic with 1227 transitions.
[2025-06-03 17:24:46] [INFO ] Flatten gal took : 52 ms
[2025-06-03 17:24:46] [INFO ] Flatten gal took : 54 ms
[2025-06-03 17:24:46] [INFO ] Applying decomposition
[2025-06-03 17:24:46] [INFO ] Flatten gal took : 53 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/graph17405070352241687016.txt' '-o' '/tmp/graph17405070352241687016.bin' '-w' '/tmp/graph17405070352241687016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17405070352241687016.bin' '-l' '-1' '-v' '-w' '/tmp/graph17405070352241687016.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:24:46] [INFO ] Decomposing Gal with order
[2025-06-03 17:24:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:24:47] [INFO ] Removed a total of 2190 redundant transitions.
[2025-06-03 17:24:47] [INFO ] Flatten gal took : 1228 ms
[2025-06-03 17:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1104 labels/synchronizations in 35 ms.
[2025-06-03 17:24:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality15919315160044210379.gal : 6 ms
[2025-06-03 17:24:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality18880642693861691.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15919315160044210379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18880642693861691.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.47634e+08,42.8927,982284,2,577821,5,2.02392e+06,6,0,1714,1.35475e+06,0
Converting to forward existential form...Done !
original formula: A(EG(!((((gu6.VIDANGE_1+gu6.VIDANGE_2)<=(gu6.CONTROLEUR_1+gu6.CONTROLEUR_2))||(!((gu2.ROUTE_B>=20)||((gu5.CHOIX_1+gu5.CHOIX_2)<=1)))))) U...443
=> equivalent forward existential formula: [((Init * !(EG(!((((EX(!(E(TRUE U !((gu6.SORTI_A<=37))))) * E(EX(TRUE) U ((gu6.VIDANGE_1+gu6.VIDANGE_2)<=gu6.SOR...1182
Reverse transition relation is NOT exact ! Due to transitions gu4.t104, t0, t51, t102, t103, t105, t176, t177, t207, t281, t508, t517, t878, t901, t911, t1...286
Detected timeout of ITS tools.
[2025-06-03 17:50:26] [INFO ] Flatten gal took : 474 ms
[2025-06-03 17:50:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2759313572141510686.gal : 134 ms
[2025-06-03 17:50:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality2861028951518145170.ctl : 58 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2759313572141510686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2861028951518145170.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-174853765000385"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;