About the Execution of ITS-Tools for PolyORBNT-PT-S05J60
| 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 | ?TFFFTFTTFFFFT?F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254400659.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 PolyORBNT-PT-S05J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254400659
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 162K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 257K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 301K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 132K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 641K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBNT-PT-S05J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749091541732
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 02:45:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 02:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 02:45:43] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2025-06-05 02:45:43] [INFO ] Transformed 909 places.
[2025-06-05 02:45:43] [INFO ] Transformed 1970 transitions.
[2025-06-05 02:45:43] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 453 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1315
Applied a total of 5 rules in 86 ms. Remains 904 /909 variables (removed 5) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2025-06-05 02:45:43] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2025-06-05 02:45:43] [INFO ] Computed 137 invariants in 91 ms
[2025-06-05 02:45:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42061ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 42100ms
[2025-06-05 02:46:25] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-05 02:46:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:46:27] [INFO ] Implicit Places using invariants in 1715 ms returned []
[2025-06-05 02:46:27] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-05 02:46:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:46:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:46:36] [INFO ] Implicit Places using invariants and state equation in 8708 ms returned []
Implicit Place search using SMT with State Equation took 10444 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2025-06-05 02:46:36] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-05 02:46:36] [INFO ] Invariant cache hit.
[2025-06-05 02:46:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 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 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61425ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 61429ms
Starting structural reductions in LTL mode, iteration 1 : 904/909 places, 1315/1315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114118 ms. Remains : 904/909 places, 1315/1315 transitions.
Support contains 453 out of 904 places after structural reductions.
[2025-06-05 02:47:38] [INFO ] Flatten gal took : 237 ms
[2025-06-05 02:47:38] [INFO ] Flatten gal took : 213 ms
[2025-06-05 02:47:38] [INFO ] Input system was already deterministic with 1315 transitions.
RANDOM walk for 40000 steps (2736 resets) in 3416 ms. (11 steps per ms) remains 9/28 properties
BEST_FIRST walk for 40002 steps (535 resets) in 323 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1005 resets) in 344 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (555 resets) in 450 ms. (88 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (521 resets) in 234 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (615 resets) in 281 ms. (141 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (476 resets) in 253 ms. (157 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (995 resets) in 298 ms. (133 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (992 resets) in 263 ms. (151 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (302 resets) in 194 ms. (205 steps per ms) remains 9/9 properties
[2025-06-05 02:47:40] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-05 02:47:40] [INFO ] Invariant cache hit.
[2025-06-05 02:47:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 407/477 variables, 49/49 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 240/717 variables, 48/97 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 5 (OVERLAPS) 172/889 variables, 26/123 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 0/123 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/903 variables, 14/137 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/903 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1311/2214 variables, 903/1040 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2214 variables, 1/1041 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2214 variables, 0/1041 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2215 variables, 1/1042 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2215 variables, 0/1042 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2215 variables, 0/1042 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2215/2215 variables, and 1042 constraints, problems are : Problem set: 8 solved, 1 unsolved in 1623 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 904/904 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 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: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 193/197 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/483 variables, 48/51 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/713 variables, 46/97 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 0/97 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 176/889 variables, 26/123 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/889 variables, 0/123 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/903 variables, 14/137 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/903 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1311/2214 variables, 903/1040 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2214 variables, 1/1041 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2214 variables, 1/1042 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2214 variables, 0/1042 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2215 variables, 1/1043 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2215 variables, 0/1043 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2215 variables, 0/1043 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2215/2215 variables, and 1043 constraints, problems are : Problem set: 8 solved, 1 unsolved in 2558 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 904/904 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4247ms problems are : Problem set: 8 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 4 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 308 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 904 transition count 1252
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 841 transition count 1251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 840 transition count 1251
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 128 place count 840 transition count 1187
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 256 place count 776 transition count 1187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 260 place count 774 transition count 1185
Applied a total of 260 rules in 282 ms. Remains 774 /904 variables (removed 130) and now considering 1185/1315 (removed 130) transitions.
Running 1179 sub problems to find dead transitions.
[2025-06-05 02:47:45] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
// Phase 1: matrix 1181 rows 774 cols
[2025-06-05 02:47:45] [INFO ] Computed 137 invariants in 67 ms
[2025-06-05 02:47:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 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 Real declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:48:10] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:48:20] [INFO ] Deduced a trap composed of 133 places in 421 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:48:27] [INFO ] Deduced a trap composed of 17 places in 368 ms of which 34 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 135 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41759ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 41763ms
[2025-06-05 02:48:27] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:48:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:48:29] [INFO ] Implicit Places using invariants in 2010 ms returned []
[2025-06-05 02:48:29] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:48:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:48:39] [INFO ] Implicit Places using invariants and state equation in 10473 ms returned []
Implicit Place search using SMT with State Equation took 12497 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:48:39] [INFO ] Redundant transitions in 64 ms returned []
Running 1179 sub problems to find dead transitions.
[2025-06-05 02:48:39] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:48:39] [INFO ] Invariant cache hit.
[2025-06-05 02:48:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:49:11] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 29 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1955 variables, and 133 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/769 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:49:18] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:49:27] [INFO ] Deduced a trap composed of 133 places in 310 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/769 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 135 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61342ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 61345ms
Starting structural reductions in SI_LTL mode, iteration 1 : 774/904 places, 1185/1315 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115982 ms. Remains : 774/904 places, 1185/1315 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-00
Product exploration explored 100000 steps with 6229 reset in 3358 ms.
Product exploration explored 100000 steps with 6267 reset in 3245 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 316 steps (20 resets) in 30 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p0)]
Support contains 308 out of 774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 774/774 places, 1185/1185 transitions.
Applied a total of 0 rules in 38 ms. Remains 774 /774 variables (removed 0) and now considering 1185/1185 (removed 0) transitions.
Running 1179 sub problems to find dead transitions.
[2025-06-05 02:49:48] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:49:48] [INFO ] Invariant cache hit.
[2025-06-05 02:49:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:50:23] [INFO ] Deduced a trap composed of 133 places in 319 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:50:24] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 134 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41649ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 41652ms
[2025-06-05 02:50:30] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:50:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:50:32] [INFO ] Implicit Places using invariants in 2035 ms returned []
[2025-06-05 02:50:32] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:50:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:50:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:50:43] [INFO ] Implicit Places using invariants and state equation in 10709 ms returned []
Implicit Place search using SMT with State Equation took 12775 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:50:43] [INFO ] Redundant transitions in 55 ms returned []
Running 1179 sub problems to find dead transitions.
[2025-06-05 02:50:43] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:50:43] [INFO ] Invariant cache hit.
[2025-06-05 02:50:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:51:27] [INFO ] Deduced a trap composed of 133 places in 299 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:51:28] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/769 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 134 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61509ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 61512ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116061 ms. Remains : 774/774 places, 1185/1185 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 147 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 154 steps (3 resets) in 9 ms. (15 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 6276 reset in 2374 ms.
Product exploration explored 100000 steps with 6274 reset in 2420 ms.
Built C files in :
/tmp/ltsmin2771617195433440998
[2025-06-05 02:51:50] [INFO ] Computing symmetric may disable matrix : 1185 transitions.
[2025-06-05 02:51:50] [INFO ] Computation of Complete disable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:51:50] [INFO ] Computing symmetric may enable matrix : 1185 transitions.
[2025-06-05 02:51:50] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:51:50] [INFO ] Computing Do-Not-Accords matrix : 1185 transitions.
[2025-06-05 02:51:50] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:51:50] [INFO ] Built C files in 483ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2771617195433440998
Running compilation step : cd /tmp/ltsmin2771617195433440998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2771617195433440998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2771617195433440998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 308 out of 774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 774/774 places, 1185/1185 transitions.
Applied a total of 0 rules in 50 ms. Remains 774 /774 variables (removed 0) and now considering 1185/1185 (removed 0) transitions.
Running 1179 sub problems to find dead transitions.
[2025-06-05 02:51:53] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:51:53] [INFO ] Invariant cache hit.
[2025-06-05 02:51:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1955 variables, and 132 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1179/1179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:52:28] [INFO ] Deduced a trap composed of 133 places in 313 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:52:29] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1955 variables, and 134 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1179 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41637ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 41640ms
[2025-06-05 02:52:35] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:52:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:52:37] [INFO ] Implicit Places using invariants in 2105 ms returned []
[2025-06-05 02:52:37] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:52:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:52:48] [INFO ] Implicit Places using invariants and state equation in 10710 ms returned []
Implicit Place search using SMT with State Equation took 12821 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:52:48] [INFO ] Redundant transitions in 36 ms returned []
Running 1179 sub problems to find dead transitions.
[2025-06-05 02:52:48] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
[2025-06-05 02:52:48] [INFO ] Invariant cache hit.
[2025-06-05 02:52:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:53:20] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 29 ms to minimize.
SMT process timed out in 31874ms, After SMT, problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 31877ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86458 ms. Remains : 774/774 places, 1185/1185 transitions.
Built C files in :
/tmp/ltsmin2796014546430928252
[2025-06-05 02:53:20] [INFO ] Computing symmetric may disable matrix : 1185 transitions.
[2025-06-05 02:53:20] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:53:20] [INFO ] Computing symmetric may enable matrix : 1185 transitions.
[2025-06-05 02:53:20] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:53:20] [INFO ] Computing Do-Not-Accords matrix : 1185 transitions.
[2025-06-05 02:53:20] [INFO ] Computation of Completed DNA matrix. took 97 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:53:20] [INFO ] Built C files in 415ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2796014546430928252
Running compilation step : cd /tmp/ltsmin2796014546430928252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2796014546430928252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2796014546430928252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-05 02:53:23] [INFO ] Flatten gal took : 72 ms
[2025-06-05 02:53:23] [INFO ] Flatten gal took : 58 ms
[2025-06-05 02:53:23] [INFO ] Time to serialize gal into /tmp/LTL6684108484924524875.gal : 21 ms
[2025-06-05 02:53:23] [INFO ] Time to serialize properties into /tmp/LTL2469692424350686850.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6684108484924524875.gal' '-t' 'CGAL' '-hoa' '/tmp/aut514480697199791151.hoa' '-atoms' '/tmp/LTL2469692424350686850.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL2469692424350686850.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut514480697199791151.hoa
Detected timeout of ITS tools.
[2025-06-05 02:53:39] [INFO ] Flatten gal took : 47 ms
[2025-06-05 02:53:39] [INFO ] Flatten gal took : 48 ms
[2025-06-05 02:53:39] [INFO ] Time to serialize gal into /tmp/LTL3302806653661040024.gal : 14 ms
[2025-06-05 02:53:39] [INFO ] Time to serialize properties into /tmp/LTL7765603987179246240.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3302806653661040024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7765603987179246240.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(NotifyEventEndOfCheckSourcesE_1<=Check_Sources_B_1)"))U(G("((NotifyEventEndOfCheckSourcesE_1<=Check_Sources_B_1)&&(QueueJobE_1...5906
Formula 0 simplified : G!"(NotifyEventEndOfCheckSourcesE_1<=Check_Sources_B_1)" R F!"((NotifyEventEndOfCheckSourcesE_1<=Check_Sources_B_1)&&(QueueJobE_1<=(...5899
Detected timeout of ITS tools.
[2025-06-05 02:53:54] [INFO ] Flatten gal took : 45 ms
[2025-06-05 02:53:54] [INFO ] Applying decomposition
[2025-06-05 02:53:54] [INFO ] Flatten gal took : 76 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/graph16840354243889953550.txt' '-o' '/tmp/graph16840354243889953550.bin' '-w' '/tmp/graph16840354243889953550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16840354243889953550.bin' '-l' '-1' '-v' '-w' '/tmp/graph16840354243889953550.weights' '-q' '0' '-e' '0.001'
[2025-06-05 02:53:54] [INFO ] Decomposing Gal with order
[2025-06-05 02:53:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 02:53:55] [INFO ] Removed a total of 1198 redundant transitions.
[2025-06-05 02:53:56] [INFO ] Flatten gal took : 1143 ms
[2025-06-05 02:53:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 175 labels/synchronizations in 129 ms.
[2025-06-05 02:53:56] [INFO ] Time to serialize gal into /tmp/LTL14973334168869588228.gal : 31 ms
[2025-06-05 02:53:56] [INFO ] Time to serialize properties into /tmp/LTL13529164695543742995.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14973334168869588228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13529164695543742995.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("(gi1.gi0.gu41.NotifyEventEndOfCheckSourcesE_1<=gi1.gi0.gu41.Check_Sources_B_1)"))U(G("((gi1.gi0.gu41.NotifyEventEndOfCheckSourc...7182
Formula 0 simplified : G!"(gi1.gi0.gu41.NotifyEventEndOfCheckSourcesE_1<=gi1.gi0.gu41.Check_Sources_B_1)" R F!"((gi1.gi0.gu41.NotifyEventEndOfCheckSourcesE...7175
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-00 finished in 386517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&X(p1)))))'
Support contains 62 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1314
Applied a total of 2 rules in 95 ms. Remains 903 /904 variables (removed 1) and now considering 1314/1315 (removed 1) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-05 02:54:11] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
// Phase 1: matrix 1310 rows 903 cols
[2025-06-05 02:54:11] [INFO ] Computed 137 invariants in 32 ms
[2025-06-05 02:54:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41968ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41970ms
[2025-06-05 02:54:53] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 02:54:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:54:56] [INFO ] Implicit Places using invariants in 2485 ms returned []
[2025-06-05 02:54:56] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 02:54:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:54:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:55:16] [INFO ] Implicit Places using invariants and state equation in 19807 ms returned []
Implicit Place search using SMT with State Equation took 22304 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-05 02:55:16] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 02:55:16] [INFO ] Invariant cache hit.
[2025-06-05 02:55:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
(s557 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 (/ 1.0 4.0))
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 3.0)
(s210 0.0)
(s211 0.0)
(s212 4.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 8.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 2.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 4.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 4.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s534 1.0)
(s535 0.0)
(s536 4.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 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 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61401ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61407ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1314/1315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125787 ms. Remains : 903/904 places, 1314/1315 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-02
Product exploration explored 100000 steps with 25032 reset in 501 ms.
Product exploration explored 100000 steps with 24992 reset in 505 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
RANDOM walk for 700 steps (47 resets) in 9 ms. (70 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Support contains 62 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1314/1314 transitions.
Applied a total of 0 rules in 22 ms. Remains 903 /903 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-05 02:56:19] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 02:56:19] [INFO ] Invariant cache hit.
[2025-06-05 02:56:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 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 Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41494ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41496ms
[2025-06-05 02:57:00] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 02:57:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:57:03] [INFO ] Implicit Places using invariants in 2407 ms returned []
[2025-06-05 02:57:03] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 02:57:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:57:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:57:23] [INFO ] Implicit Places using invariants and state equation in 20033 ms returned []
Implicit Place search using SMT with State Equation took 22453 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-05 02:57:23] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 02:57:23] [INFO ] Invariant cache hit.
[2025-06-05 02:57:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61564ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61567ms
Finished structural reductions in LTL mode , in 1 iterations and 125545 ms. Remains : 903/903 places, 1314/1314 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
RANDOM walk for 475 steps (28 resets) in 10 ms. (43 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Product exploration explored 100000 steps with 24966 reset in 453 ms.
Product exploration explored 100000 steps with 24960 reset in 499 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Support contains 62 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1314/1314 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 903 transition count 1314
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 64 place count 903 transition count 1315
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 903 transition count 1315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 902 transition count 1314
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 902 transition count 1314
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 134 place count 902 transition count 1314
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 197 place count 839 transition count 1251
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 260 place count 839 transition count 1251
Deduced a syphon composed of 68 places in 10 ms
Applied a total of 260 rules in 313 ms. Remains 839 /903 variables (removed 64) and now considering 1251/1314 (removed 63) transitions.
Running 1245 sub problems to find dead transitions.
[2025-06-05 02:58:27] [INFO ] Flow matrix only has 1247 transitions (discarded 4 similar events)
// Phase 1: matrix 1247 rows 839 cols
[2025-06-05 02:58:27] [INFO ] Computed 137 invariants in 20 ms
[2025-06-05 02:58:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/834 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:45] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 19 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:45] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 19 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:46] [INFO ] Deduced a trap composed of 7 places in 336 ms of which 19 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:46] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 19 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:47] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 19 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:47] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 19 ms to minimize.
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:48] [INFO ] Deduced a trap composed of 73 places in 381 ms of which 51 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD107 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 834/2086 variables, and 139 constraints, problems are : Problem set: 9 solved, 1236 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/839 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1245/1245 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1236 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 105/105 constraints. Problems are: Problem set: 9 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 17/122 constraints. Problems are: Problem set: 9 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 7/129 constraints. Problems are: Problem set: 9 solved, 1236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:50] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:50] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:50] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:51] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:51] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:51] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:51] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:51] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:51] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:51] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:52] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:52] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:52] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:52] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:52] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:52] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:52] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:52] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:55] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD563 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/826 variables, 20/149 constraints. Problems are: Problem set: 26 solved, 1219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:58] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD172 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:58] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD181 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:59] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Problem TDEAD229 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:58:59] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:00] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Problem TDEAD289 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:00] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Problem TDEAD303 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:00] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD324 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:00] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Problem TDEAD331 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:00] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 2 ms to minimize.
Problem TDEAD333 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:01] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 4 ms to minimize.
Problem TDEAD399 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:02] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Problem TDEAD409 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:02] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Problem TDEAD427 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:02] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
Problem TDEAD430 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:03] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD473 is UNSAT
Problem TDEAD493 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:03] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
Problem TDEAD511 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:03] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
Problem TDEAD513 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:04] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 2 ms to minimize.
Problem TDEAD536 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:04] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
Problem TDEAD537 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:05] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Problem TDEAD172 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 20/169 constraints. Problems are: Problem set: 46 solved, 1199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:59:06] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/2086 variables, and 170 constraints, problems are : Problem set: 46 solved, 1199 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 105/111 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/839 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1245 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41569ms problems are : Problem set: 46 solved, 1199 unsolved
Search for dead transitions found 46 dead transitions in 41572ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 46 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:59:09] [INFO ] Redundant transitions in 21 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 839/903 places, 1205/1314 transitions.
Graph (complete) has 4266 edges and 839 vertex of which 794 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.5 ms
Discarding 45 places :
Also discarding 0 output transitions
Deduced a syphon composed of 23 places in 1 ms
Applied a total of 1 rules in 41 ms. Remains 794 /839 variables (removed 45) and now considering 1205/1205 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 794/903 places, 1205/1314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41968 ms. Remains : 794/903 places, 1205/1314 transitions.
Built C files in :
/tmp/ltsmin10866120779495484021
[2025-06-05 02:59:09] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10866120779495484021
Running compilation step : cd /tmp/ltsmin10866120779495484021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2715 ms.
Running link step : cd /tmp/ltsmin10866120779495484021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10866120779495484021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2127550895454083440.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 62 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1314/1314 transitions.
Applied a total of 0 rules in 23 ms. Remains 903 /903 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-05 02:59:24] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
// Phase 1: matrix 1310 rows 903 cols
[2025-06-05 02:59:24] [INFO ] Computed 137 invariants in 27 ms
[2025-06-05 02:59:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41562ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41565ms
[2025-06-05 03:00:05] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:00:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:00:07] [INFO ] Implicit Places using invariants in 2223 ms returned []
[2025-06-05 03:00:08] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:00:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:00:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:00:27] [INFO ] Implicit Places using invariants and state equation in 19980 ms returned []
Implicit Place search using SMT with State Equation took 22217 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-05 03:00:28] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:00:28] [INFO ] Invariant cache hit.
[2025-06-05 03:00:28] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61385ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61391ms
Finished structural reductions in LTL mode , in 1 iterations and 125201 ms. Remains : 903/903 places, 1314/1314 transitions.
Built C files in :
/tmp/ltsmin257841556200921025
[2025-06-05 03:01:29] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin257841556200921025
Running compilation step : cd /tmp/ltsmin257841556200921025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2595 ms.
Running link step : cd /tmp/ltsmin257841556200921025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin257841556200921025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18022142969889288803.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 03:01:44] [INFO ] Flatten gal took : 69 ms
[2025-06-05 03:01:44] [INFO ] Flatten gal took : 67 ms
[2025-06-05 03:01:44] [INFO ] Time to serialize gal into /tmp/LTL8670041373732790474.gal : 8 ms
[2025-06-05 03:01:44] [INFO ] Time to serialize properties into /tmp/LTL18151349194507051601.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8670041373732790474.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11385803110562685254.hoa' '-atoms' '/tmp/LTL18151349194507051601.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18151349194507051601.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11385803110562685254.hoa
Detected timeout of ITS tools.
[2025-06-05 03:01:59] [INFO ] Flatten gal took : 97 ms
[2025-06-05 03:01:59] [INFO ] Flatten gal took : 49 ms
[2025-06-05 03:01:59] [INFO ] Time to serialize gal into /tmp/LTL267196898633719048.gal : 14 ms
[2025-06-05 03:01:59] [INFO ] Time to serialize properties into /tmp/LTL1039273619984616287.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL267196898633719048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1039273619984616287.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(Check_Sources_B_1<1)"))&&(X("(((((((QueueJobB_1_8+QueueJobB_1_45)+(QueueJobB_1_18+QueueJobB_1_27))+((QueueJobB_1_36+QueueJ...1097
Formula 0 simplified : XF(G!"(Check_Sources_B_1<1)" | X!"(((((((QueueJobB_1_8+QueueJobB_1_45)+(QueueJobB_1_18+QueueJobB_1_27))+((QueueJobB_1_36+QueueJobB_1...1087
Detected timeout of ITS tools.
[2025-06-05 03:02:15] [INFO ] Flatten gal took : 50 ms
[2025-06-05 03:02:15] [INFO ] Applying decomposition
[2025-06-05 03:02:15] [INFO ] Flatten gal took : 51 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/graph4533058536348602896.txt' '-o' '/tmp/graph4533058536348602896.bin' '-w' '/tmp/graph4533058536348602896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4533058536348602896.bin' '-l' '-1' '-v' '-w' '/tmp/graph4533058536348602896.weights' '-q' '0' '-e' '0.001'
[2025-06-05 03:02:15] [INFO ] Decomposing Gal with order
[2025-06-05 03:02:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 03:02:15] [INFO ] Removed a total of 1453 redundant transitions.
[2025-06-05 03:02:15] [INFO ] Flatten gal took : 368 ms
[2025-06-05 03:02:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 732 labels/synchronizations in 52 ms.
[2025-06-05 03:02:15] [INFO ] Time to serialize gal into /tmp/LTL2505360099736160686.gal : 22 ms
[2025-06-05 03:02:15] [INFO ] Time to serialize properties into /tmp/LTL11866371961570983896.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2505360099736160686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11866371961570983896.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(gi1.gi1.gu29.Check_Sources_B_1<1)"))&&(X("(((((((gu14.QueueJobB_1_8+gu14.QueueJobB_1_45)+(gu14.QueueJobB_1_18+gu14.QueueJo...1415
Formula 0 simplified : XF(G!"(gi1.gi1.gu29.Check_Sources_B_1<1)" | X!"(((((((gu14.QueueJobB_1_8+gu14.QueueJobB_1_45)+(gu14.QueueJobB_1_18+gu14.QueueJobB_1_...1405
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-02 finished in 499266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0||X(p1)))||X(G(p0))))))'
Support contains 3 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Applied a total of 0 rules in 30 ms. Remains 904 /904 variables (removed 0) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2025-06-05 03:02:31] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2025-06-05 03:02:31] [INFO ] Computed 137 invariants in 21 ms
[2025-06-05 03:02:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41493ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 41496ms
[2025-06-05 03:03:12] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-05 03:03:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:03:14] [INFO ] Implicit Places using invariants in 2300 ms returned []
[2025-06-05 03:03:14] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-05 03:03:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:03:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:03:33] [INFO ] Implicit Places using invariants and state equation in 18500 ms returned []
Implicit Place search using SMT with State Equation took 20814 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2025-06-05 03:03:33] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-05 03:03:33] [INFO ] Invariant cache hit.
[2025-06-05 03:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61386ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 61392ms
Finished structural reductions in LTL mode , in 1 iterations and 123740 ms. Remains : 904/904 places, 1315/1315 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 352 steps with 24 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-03 finished in 124027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 132 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 260 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 771 transition count 1182
Applied a total of 266 rules in 99 ms. Remains 771 /904 variables (removed 133) and now considering 1182/1315 (removed 133) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-05 03:04:35] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2025-06-05 03:04:35] [INFO ] Computed 137 invariants in 37 ms
[2025-06-05 03:04:35] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1949 variables, and 131 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1949 variables, and 131 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41602ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 41604ms
[2025-06-05 03:05:16] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:05:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:05:19] [INFO ] Implicit Places using invariants in 2490 ms returned []
[2025-06-05 03:05:19] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:05:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:05:35] [INFO ] Implicit Places using invariants and state equation in 15951 ms returned []
Implicit Place search using SMT with State Equation took 18447 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:05:35] [INFO ] Redundant transitions in 19 ms returned []
Running 1176 sub problems to find dead transitions.
[2025-06-05 03:05:35] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:05:35] [INFO ] Invariant cache hit.
[2025-06-05 03:05:35] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1949 variables, and 131 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1949 variables, and 131 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61380ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 61383ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/904 places, 1182/1315 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121569 ms. Remains : 771/904 places, 1182/1315 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-06
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-06 finished in 121658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1314
Applied a total of 2 rules in 54 ms. Remains 903 /904 variables (removed 1) and now considering 1314/1315 (removed 1) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-05 03:06:36] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
// Phase 1: matrix 1310 rows 903 cols
[2025-06-05 03:06:36] [INFO ] Computed 137 invariants in 22 ms
[2025-06-05 03:06:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 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 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41455ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41457ms
[2025-06-05 03:07:18] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:07:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:07:20] [INFO ] Implicit Places using invariants in 2294 ms returned []
[2025-06-05 03:07:20] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:07:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:07:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:07:40] [INFO ] Implicit Places using invariants and state equation in 19917 ms returned []
Implicit Place search using SMT with State Equation took 22220 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-05 03:07:40] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:07:40] [INFO ] Invariant cache hit.
[2025-06-05 03:07:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61521ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61524ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1314/1315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125265 ms. Remains : 903/904 places, 1314/1315 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-08
Product exploration explored 100000 steps with 16666 reset in 373 ms.
Product exploration explored 100000 steps with 16666 reset in 418 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2782 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (462 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 136768 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 1
Probabilistic random walk after 136768 steps, saw 41289 distinct states, run finished after 3007 ms. (steps per millisecond=45 ) properties seen :0
[2025-06-05 03:08:46] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:08:46] [INFO ] Invariant cache hit.
[2025-06-05 03:08:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 193/197 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/483 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/713 variables, 46/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 175/888 variables, 26/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/902 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1310/2212 variables, 902/1039 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2212 variables, 1/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2212 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2213 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2213 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2213 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2213/2213 variables, and 1041 constraints, problems are : Problem set: 0 solved, 1 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 903/903 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 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: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 193/197 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/483 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/713 variables, 46/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 175/888 variables, 26/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/902 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1310/2212 variables, 902/1039 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2212 variables, 1/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2212 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2212 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2213 variables, 1/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2213 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2213 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2213/2213 variables, and 1042 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2333 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 903/903 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3134ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1314/1314 transitions.
Applied a total of 0 rules in 30 ms. Remains 903 /903 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-05 03:08:50] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:08:50] [INFO ] Invariant cache hit.
[2025-06-05 03:08:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 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 Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41431ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41434ms
[2025-06-05 03:09:31] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:09:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:09:34] [INFO ] Implicit Places using invariants in 2303 ms returned []
[2025-06-05 03:09:34] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:09:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:09:54] [INFO ] Implicit Places using invariants and state equation in 19901 ms returned []
Implicit Place search using SMT with State Equation took 22210 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-05 03:09:54] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:09:54] [INFO ] Invariant cache hit.
[2025-06-05 03:09:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 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 Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 4)
(s210 0)
(s211 0)
(s212 3)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 2)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 1)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 10)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61392ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61399ms
Finished structural reductions in LTL mode , in 1 iterations and 125079 ms. Remains : 903/903 places, 1314/1314 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2735 resets) in 445 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (531 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 136666 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 1
Probabilistic random walk after 136666 steps, saw 41262 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2025-06-05 03:10:58] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:10:58] [INFO ] Invariant cache hit.
[2025-06-05 03:10:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 193/197 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/483 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/713 variables, 46/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 175/888 variables, 26/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/902 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1310/2212 variables, 902/1039 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2212 variables, 1/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2212 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2213 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2213 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2213 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2213/2213 variables, and 1041 constraints, problems are : Problem set: 0 solved, 1 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 903/903 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 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: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 193/197 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/483 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/713 variables, 46/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 175/888 variables, 26/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/902 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1310/2212 variables, 902/1039 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2212 variables, 1/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2212 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2212 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2213 variables, 1/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2213 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2213 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2213/2213 variables, and 1042 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2342 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 903/903 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3219ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 399 ms.
Product exploration explored 100000 steps with 16666 reset in 419 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1314/1314 transitions.
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 903 transition count 1314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 65 place count 903 transition count 1315
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 903 transition count 1315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 902 transition count 1314
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 902 transition count 1314
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 131 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 134 place count 902 transition count 1314
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 197 place count 839 transition count 1251
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 260 place count 839 transition count 1251
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 260 rules in 239 ms. Remains 839 /903 variables (removed 64) and now considering 1251/1314 (removed 63) transitions.
Running 1245 sub problems to find dead transitions.
[2025-06-05 03:11:04] [INFO ] Flow matrix only has 1247 transitions (discarded 4 similar events)
// Phase 1: matrix 1247 rows 839 cols
[2025-06-05 03:11:04] [INFO ] Computed 137 invariants in 19 ms
[2025-06-05 03:11:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/834 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1245 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 Real declared 834/2086 variables, and 132 constraints, problems are : Problem set: 0 solved, 1245 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/839 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1245/1245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1245 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/834 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:11:28] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:11:28] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 19 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:11:29] [INFO ] Deduced a trap composed of 7 places in 346 ms of which 18 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:11:29] [INFO ] Deduced a trap composed of 7 places in 347 ms of which 19 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:11:30] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 18 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:11:30] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 19 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:11:31] [INFO ] Deduced a trap composed of 73 places in 383 ms of which 63 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD596 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 834/2086 variables, and 139 constraints, problems are : Problem set: 65 solved, 1180 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/839 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1245 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41832ms problems are : Problem set: 65 solved, 1180 unsolved
Search for dead transitions found 65 dead transitions in 41834ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 65 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:11:46] [INFO ] Redundant transitions in 22 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 839/903 places, 1186/1314 transitions.
Graph (complete) has 4246 edges and 839 vertex of which 775 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.3 ms
Discarding 64 places :
Also discarding 0 output transitions
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 1 rules in 48 ms. Remains 775 /839 variables (removed 64) and now considering 1186/1186 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 775/903 places, 1186/1314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42153 ms. Remains : 775/903 places, 1186/1314 transitions.
Built C files in :
/tmp/ltsmin1619702081896551616
[2025-06-05 03:11:46] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1619702081896551616
Running compilation step : cd /tmp/ltsmin1619702081896551616;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2684 ms.
Running link step : cd /tmp/ltsmin1619702081896551616;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1619702081896551616;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10879405696284530574.hoa' '--buchi-type=spotba'
LTSmin run took 392 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-08 finished in 312515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(X(X(X(G(p1))))))))'
Support contains 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1314
Applied a total of 2 rules in 55 ms. Remains 903 /904 variables (removed 1) and now considering 1314/1315 (removed 1) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-05 03:11:49] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
// Phase 1: matrix 1310 rows 903 cols
[2025-06-05 03:11:49] [INFO ] Computed 137 invariants in 26 ms
[2025-06-05 03:11:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 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 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41508ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41510ms
[2025-06-05 03:12:30] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:12:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:12:33] [INFO ] Implicit Places using invariants in 2272 ms returned []
[2025-06-05 03:12:33] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:12:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:12:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:12:52] [INFO ] Implicit Places using invariants and state equation in 19373 ms returned []
Implicit Place search using SMT with State Equation took 21653 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-05 03:12:52] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:12:52] [INFO ] Invariant cache hit.
[2025-06-05 03:12:52] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61497ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61500ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1314/1315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124728 ms. Remains : 903/904 places, 1314/1315 transitions.
Stuttering acceptance computed with spot in 367 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-09
Stuttering criterion allowed to conclude after 13986 steps with 1732 reset in 74 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-09 finished in 125199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||F(G(p2))))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1314
Applied a total of 2 rules in 48 ms. Remains 903 /904 variables (removed 1) and now considering 1314/1315 (removed 1) transitions.
Running 1308 sub problems to find dead transitions.
[2025-06-05 03:13:54] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:13:54] [INFO ] Invariant cache hit.
[2025-06-05 03:13:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41328ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 41330ms
[2025-06-05 03:14:35] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:14:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:14:38] [INFO ] Implicit Places using invariants in 2301 ms returned []
[2025-06-05 03:14:38] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:14:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:14:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:14:57] [INFO ] Implicit Places using invariants and state equation in 19099 ms returned []
Implicit Place search using SMT with State Equation took 21407 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2025-06-05 03:14:57] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2025-06-05 03:14:57] [INFO ] Invariant cache hit.
[2025-06-05 03:14:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 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 Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61397ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 61401ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1314/1315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124197 ms. Remains : 903/904 places, 1314/1315 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-12
Stuttering criterion allowed to conclude after 34596 steps with 2373 reset in 156 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-12 finished in 124613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
Support contains 3 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 132 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 260 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 771 transition count 1182
Applied a total of 266 rules in 104 ms. Remains 771 /904 variables (removed 133) and now considering 1182/1315 (removed 133) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-05 03:15:59] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2025-06-05 03:15:59] [INFO ] Computed 137 invariants in 26 ms
[2025-06-05 03:15:59] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 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 Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:16:24] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:16:33] [INFO ] Deduced a trap composed of 132 places in 425 ms of which 100 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 134 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41417ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 41420ms
[2025-06-05 03:16:40] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:16:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:16:42] [INFO ] Implicit Places using invariants in 2184 ms returned []
[2025-06-05 03:16:42] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:16:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:16:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:16:59] [INFO ] Implicit Places using invariants and state equation in 17096 ms returned []
Implicit Place search using SMT with State Equation took 19284 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:16:59] [INFO ] Redundant transitions in 24 ms returned []
Running 1176 sub problems to find dead transitions.
[2025-06-05 03:16:59] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:16:59] [INFO ] Invariant cache hit.
[2025-06-05 03:16:59] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 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 Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:17:36] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61368ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 61371ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/904 places, 1182/1315 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122218 ms. Remains : 771/904 places, 1182/1315 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-14
Product exploration explored 100000 steps with 4937 reset in 781 ms.
Product exploration explored 100000 steps with 4938 reset in 822 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 9407 steps (439 resets) in 98 ms. (95 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 771 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 40 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-05 03:18:03] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:18:03] [INFO ] Invariant cache hit.
[2025-06-05 03:18:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:18:30] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 1)
(s216 1)
(s217 0)
(s218 0)
(s219 1)
(s220 9)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41409ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 41413ms
[2025-06-05 03:18:45] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:18:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:18:47] [INFO ] Implicit Places using invariants in 2142 ms returned []
[2025-06-05 03:18:47] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:18:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:18:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:19:03] [INFO ] Implicit Places using invariants and state equation in 16685 ms returned []
Implicit Place search using SMT with State Equation took 18841 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:19:04] [INFO ] Redundant transitions in 24 ms returned []
Running 1176 sub problems to find dead transitions.
[2025-06-05 03:19:04] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:19:04] [INFO ] Invariant cache hit.
[2025-06-05 03:19:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:19:41] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61433ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 61436ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121768 ms. Remains : 771/771 places, 1182/1182 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 8960 steps (434 resets) in 87 ms. (101 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 235 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4929 reset in 813 ms.
Product exploration explored 100000 steps with 4858 reset in 805 ms.
Built C files in :
/tmp/ltsmin5529308979641242626
[2025-06-05 03:20:07] [INFO ] Computing symmetric may disable matrix : 1182 transitions.
[2025-06-05 03:20:07] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:20:07] [INFO ] Computing symmetric may enable matrix : 1182 transitions.
[2025-06-05 03:20:07] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:20:08] [INFO ] Computing Do-Not-Accords matrix : 1182 transitions.
[2025-06-05 03:20:08] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:20:08] [INFO ] Built C files in 310ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5529308979641242626
Running compilation step : cd /tmp/ltsmin5529308979641242626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5529308979641242626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5529308979641242626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 771 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 39 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-05 03:20:11] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:20:11] [INFO ] Invariant cache hit.
[2025-06-05 03:20:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:20:38] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41528ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 41530ms
[2025-06-05 03:20:52] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:20:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:20:54] [INFO ] Implicit Places using invariants in 2183 ms returned []
[2025-06-05 03:20:54] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:20:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:21:11] [INFO ] Implicit Places using invariants and state equation in 16513 ms returned []
Implicit Place search using SMT with State Equation took 18699 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:21:11] [INFO ] Redundant transitions in 21 ms returned []
Running 1176 sub problems to find dead transitions.
[2025-06-05 03:21:11] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:21:11] [INFO ] Invariant cache hit.
[2025-06-05 03:21:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:21:48] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61449ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 61451ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121755 ms. Remains : 771/771 places, 1182/1182 transitions.
Built C files in :
/tmp/ltsmin6635202935405773463
[2025-06-05 03:22:12] [INFO ] Computing symmetric may disable matrix : 1182 transitions.
[2025-06-05 03:22:12] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:22:13] [INFO ] Computing symmetric may enable matrix : 1182 transitions.
[2025-06-05 03:22:13] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:22:13] [INFO ] Computing Do-Not-Accords matrix : 1182 transitions.
[2025-06-05 03:22:13] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:22:13] [INFO ] Built C files in 312ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6635202935405773463
Running compilation step : cd /tmp/ltsmin6635202935405773463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6635202935405773463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6635202935405773463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-05 03:22:16] [INFO ] Flatten gal took : 42 ms
[2025-06-05 03:22:16] [INFO ] Flatten gal took : 42 ms
[2025-06-05 03:22:16] [INFO ] Time to serialize gal into /tmp/LTL15054966995254942801.gal : 7 ms
[2025-06-05 03:22:16] [INFO ] Time to serialize properties into /tmp/LTL76884563398872607.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15054966995254942801.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7266486030271492087.hoa' '-atoms' '/tmp/LTL76884563398872607.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL76884563398872607.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7266486030271492087.hoa
Detected timeout of ITS tools.
[2025-06-05 03:22:31] [INFO ] Flatten gal took : 39 ms
[2025-06-05 03:22:31] [INFO ] Flatten gal took : 41 ms
[2025-06-05 03:22:31] [INFO ] Time to serialize gal into /tmp/LTL14388538214442829420.gal : 7 ms
[2025-06-05 03:22:31] [INFO ] Time to serialize properties into /tmp/LTL4904389998722424893.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14388538214442829420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4904389998722424893.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(QueueJobE_1<2)")||(X(F("(f2_56>CreatedJobs_3_3)")))))))
Formula 0 simplified : G(F!"(QueueJobE_1<2)" & FG!"(f2_56>CreatedJobs_3_3)")
Detected timeout of ITS tools.
[2025-06-05 03:22:46] [INFO ] Flatten gal took : 39 ms
[2025-06-05 03:22:46] [INFO ] Applying decomposition
[2025-06-05 03:22:46] [INFO ] Flatten gal took : 38 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/graph13152832127023734269.txt' '-o' '/tmp/graph13152832127023734269.bin' '-w' '/tmp/graph13152832127023734269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13152832127023734269.bin' '-l' '-1' '-v' '-w' '/tmp/graph13152832127023734269.weights' '-q' '0' '-e' '0.001'
[2025-06-05 03:22:46] [INFO ] Decomposing Gal with order
[2025-06-05 03:22:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 03:22:47] [INFO ] Removed a total of 363 redundant transitions.
[2025-06-05 03:22:47] [INFO ] Flatten gal took : 212 ms
[2025-06-05 03:22:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-06-05 03:22:47] [INFO ] Time to serialize gal into /tmp/LTL2821907416004330841.gal : 8 ms
[2025-06-05 03:22:47] [INFO ] Time to serialize properties into /tmp/LTL15344518728310616133.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2821907416004330841.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15344518728310616133.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gi1.gu55.QueueJobE_1<2)")||(X(F("(gu57.f2_56>gu57.CreatedJobs_3_3)")))))))
Formula 0 simplified : G(F!"(gi1.gu55.QueueJobE_1<2)" & FG!"(gu57.f2_56>gu57.CreatedJobs_3_3)")
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-14 finished in 423124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(!p0))))'
Support contains 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Applied a total of 0 rules in 29 ms. Remains 904 /904 variables (removed 0) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2025-06-05 03:23:02] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2025-06-05 03:23:02] [INFO ] Computed 137 invariants in 33 ms
[2025-06-05 03:23:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41365ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 41367ms
[2025-06-05 03:23:43] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-05 03:23:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:23:45] [INFO ] Implicit Places using invariants in 2348 ms returned []
[2025-06-05 03:23:45] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-05 03:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:23:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:24:04] [INFO ] Implicit Places using invariants and state equation in 18668 ms returned []
Implicit Place search using SMT with State Equation took 21018 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2025-06-05 03:24:04] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-05 03:24:04] [INFO ] Invariant cache hit.
[2025-06-05 03:24:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 (/ 2.0 3.0))
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 (/ 1.0 3.0))
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 (/ 2.0 3.0))
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 (/ 1.0 3.0))
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 (/ 2.0 3.0))
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 4.0)
(s210 0.0)
(s211 1.0)
(s212 4.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 8.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 2.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61398ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 61403ms
Finished structural reductions in LTL mode , in 1 iterations and 123828 ms. Remains : 904/904 places, 1315/1315 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, p0, true]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-15 finished in 123967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&X(p1)))))'
Found a Lengthening insensitive property : PolyORBNT-PT-S05J60-LTLCardinality-02
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Support contains 62 out of 904 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 904/904 places, 1315/1315 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1250
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1250
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1185
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 771 transition count 1182
Applied a total of 266 rules in 92 ms. Remains 771 /904 variables (removed 133) and now considering 1182/1315 (removed 133) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-05 03:25:06] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2025-06-05 03:25:06] [INFO ] Computed 137 invariants in 24 ms
[2025-06-05 03:25:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:25:32] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 7 ms to minimize.
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 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41455ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 41458ms
[2025-06-05 03:25:48] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:25:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:25:50] [INFO ] Implicit Places using invariants in 2154 ms returned []
[2025-06-05 03:25:50] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:25:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:25:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:26:07] [INFO ] Implicit Places using invariants and state equation in 17172 ms returned []
Implicit Place search using SMT with State Equation took 19330 ms to find 0 implicit places.
Running 1176 sub problems to find dead transitions.
[2025-06-05 03:26:07] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-05 03:26:07] [INFO ] Invariant cache hit.
[2025-06-05 03:26:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:26:42] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:26:58] [INFO ] Deduced a trap composed of 14 places in 360 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:27:03] [INFO ] Deduced a trap composed of 133 places in 434 ms of which 105 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 135 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61320ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 61325ms
Starting structural reductions in LI_LTL mode, iteration 1 : 771/904 places, 1182/1315 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 122215 ms. Remains : 771/904 places, 1182/1315 transitions.
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 76240 steps with 19009 reset in 348 ms.
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-02 finished in 122866 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
[2025-06-05 03:27:09] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12600533603390191854
[2025-06-05 03:27:09] [INFO ] Computing symmetric may disable matrix : 1315 transitions.
[2025-06-05 03:27:09] [INFO ] Applying decomposition
[2025-06-05 03:27:09] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:27:09] [INFO ] Computing symmetric may enable matrix : 1315 transitions.
[2025-06-05 03:27:09] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:27:09] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15003047409903580124.txt' '-o' '/tmp/graph15003047409903580124.bin' '-w' '/tmp/graph15003047409903580124.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15003047409903580124.bin' '-l' '-1' '-v' '-w' '/tmp/graph15003047409903580124.weights' '-q' '0' '-e' '0.001'
[2025-06-05 03:27:09] [INFO ] Decomposing Gal with order
[2025-06-05 03:27:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 03:27:09] [INFO ] Computing Do-Not-Accords matrix : 1315 transitions.
[2025-06-05 03:27:09] [INFO ] Computation of Completed DNA matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:27:09] [INFO ] Built C files in 410ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12600533603390191854
Running compilation step : cd /tmp/ltsmin12600533603390191854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-05 03:27:10] [INFO ] Removed a total of 2019 redundant transitions.
[2025-06-05 03:27:10] [INFO ] Flatten gal took : 399 ms
[2025-06-05 03:27:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 778 labels/synchronizations in 41 ms.
[2025-06-05 03:27:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality4652745197714293699.gal : 9 ms
[2025-06-05 03:27:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality7629468006163441225.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4652745197714293699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7629468006163441225.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !(((F("(gi1.gi1.gu64.NotifyEventEndOfCheckSourcesE_1<=gi1.gi1.gu64.Check_Sources_B_1)"))U(G("((gi1.gi1.gu64.NotifyEventEndOfCheckSourc...7184
Formula 0 simplified : G!"(gi1.gi1.gu64.NotifyEventEndOfCheckSourcesE_1<=gi1.gi1.gu64.Check_Sources_B_1)" R F!"((gi1.gi1.gu64.NotifyEventEndOfCheckSourcesE...7177
Compilation finished in 5140 ms.
Running link step : cd /tmp/ltsmin12600533603390191854;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin12600533603390191854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true)) U []((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin12600533603390191854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true)) U []((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12600533603390191854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp4==true)||X(<>((LTLAPp5==true))))))' '--buchi-type=spotba'
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="PolyORBNT-PT-S05J60"
export BK_EXAMINATION="LTLCardinality"
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 PolyORBNT-PT-S05J60, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254400659"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;