About the Execution of ITS-Tools for BusinessProcesses-PT-11
| 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 | ?FFFF??FF?TTT??? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300082.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 BusinessProcesses-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300082
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 141K 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 BusinessProcesses-PT-11-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-15
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-00
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-01
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-02
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-03
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-04
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-05
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-06
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-07
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-08
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-09
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-10
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748574488029
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 03:08:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 03:08:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 03:08:11] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2025-05-30 03:08:11] [INFO ] Transformed 567 places.
[2025-05-30 03:08:11] [INFO ] Transformed 508 transitions.
[2025-05-30 03:08:11] [INFO ] Found NUPN structural information;
[2025-05-30 03:08:11] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Deduced a syphon composed of 7 places in 17 ms
Reduce places removed 7 places and 7 transitions.
Support contains 114 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 65 place count 495 transition count 440
Iterating global reduction 1 with 61 rules applied. Total rules applied 126 place count 495 transition count 440
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 153 place count 468 transition count 413
Iterating global reduction 1 with 27 rules applied. Total rules applied 180 place count 468 transition count 413
Applied a total of 180 rules in 254 ms. Remains 468 /560 variables (removed 92) and now considering 413/501 (removed 88) transitions.
// Phase 1: matrix 413 rows 468 cols
[2025-05-30 03:08:11] [INFO ] Computed 91 invariants in 57 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:08:12] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2025-05-30 03:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:08:14] [INFO ] Implicit Places using invariants and state equation in 2174 ms returned []
Implicit Place search using SMT with State Equation took 3284 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2025-05-30 03:08:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:39] [INFO ] Deduced a trap composed of 63 places in 358 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:39] [INFO ] Deduced a trap composed of 64 places in 306 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:40] [INFO ] Deduced a trap composed of 64 places in 423 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:40] [INFO ] Deduced a trap composed of 64 places in 434 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:41] [INFO ] Deduced a trap composed of 63 places in 317 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:41] [INFO ] Deduced a trap composed of 62 places in 364 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:41] [INFO ] Deduced a trap composed of 63 places in 369 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:42] [INFO ] Deduced a trap composed of 63 places in 370 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:42] [INFO ] Deduced a trap composed of 63 places in 360 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:42] [INFO ] Deduced a trap composed of 64 places in 298 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:43] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:43] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:44] [INFO ] Deduced a trap composed of 63 places in 284 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:44] [INFO ] Deduced a trap composed of 63 places in 269 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:44] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:44] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:45] [INFO ] Deduced a trap composed of 64 places in 405 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:45] [INFO ] Deduced a trap composed of 63 places in 371 ms of which 79 ms to minimize.
SMT process timed out in 30646ms, After SMT, problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 30675ms
Starting structural reductions in LTL mode, iteration 1 : 468/560 places, 413/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34253 ms. Remains : 468/560 places, 413/501 transitions.
Support contains 114 out of 468 places after structural reductions.
[2025-05-30 03:08:46] [INFO ] Flatten gal took : 128 ms
[2025-05-30 03:08:46] [INFO ] Flatten gal took : 67 ms
[2025-05-30 03:08:46] [INFO ] Input system was already deterministic with 413 transitions.
Support contains 111 out of 468 places (down from 114) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 76 to 75
RANDOM walk for 40000 steps (296 resets) in 2406 ms. (16 steps per ms) remains 40/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
[2025-05-30 03:08:47] [INFO ] Invariant cache hit.
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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 283/358 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 101/459 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 407/866 variables, 459/550 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/866 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 7 (OVERLAPS) 13/879 variables, 7/557 constraints. Problems are: Problem set: 4 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 879/881 variables, and 557 constraints, problems are : Problem set: 4 solved, 36 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 466/468 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 36 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 36 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 287/354 variables, 49/49 constraints. Problems are: Problem set: 5 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:53] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:53] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:53] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:53] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:53] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:53] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:53] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:54] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:54] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:54] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:54] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:54] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:55] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:55] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:55] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:55] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:55] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:56] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:56] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:56] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 20/69 constraints. Problems are: Problem set: 5 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:56] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:56] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:56] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:57] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:57] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:57] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:57] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:57] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:57] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:57] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 28 ms to minimize.
SMT process timed out in 10227ms, After SMT, problems are : Problem set: 5 solved, 35 unsolved
Fused 35 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 66 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 413/413 transitions.
Graph (complete) has 1033 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 467 transition count 373
Reduce places removed 39 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 47 rules applied. Total rules applied 87 place count 428 transition count 365
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 420 transition count 365
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 95 place count 420 transition count 292
Deduced a syphon composed of 73 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 252 place count 336 transition count 292
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 262 place count 326 transition count 282
Iterating global reduction 3 with 10 rules applied. Total rules applied 272 place count 326 transition count 282
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 179 rules applied. Total rules applied 451 place count 236 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 452 place count 236 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 454 place count 235 transition count 196
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 462 place count 235 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 463 place count 234 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 464 place count 233 transition count 195
Applied a total of 464 rules in 225 ms. Remains 233 /468 variables (removed 235) and now considering 195/413 (removed 218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 233/468 places, 195/413 transitions.
RANDOM walk for 40000 steps (1755 resets) in 1362 ms. (29 steps per ms) remains 29/35 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 47 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (29 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (30 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (30 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (27 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (26 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (30 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (27 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (29 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 45 ms. (87 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (31 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (32 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
// Phase 1: matrix 195 rows 233 cols
[2025-05-30 03:08:58] [INFO ] Computed 78 invariants in 14 ms
[2025-05-30 03:08:58] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 76/133 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 41/174 variables, 26/47 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 6/180 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 48/228 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 195/423 variables, 228/305 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 5/428 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/428 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 315 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5421 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 233/233 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 76/133 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:04] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:04] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:04] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:04] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:04] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:05] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:05] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:05] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:05] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:05] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:05] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:05] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:05] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:05] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 41/174 variables, 26/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:06] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:06] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:06] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:06] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:07] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:07] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:07] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:07] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:07] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:07] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:07] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:07] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:08] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:08] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:08] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:08] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:08] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:08] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:08] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:08] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:09] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:09] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:09] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:09] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:09] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:09] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:09] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:09] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:10] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:10] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:10] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:10] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:10] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:10] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:10] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:11] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:11] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:11] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:11] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:11] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:11] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:11] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:12] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:12] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:12] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:12] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:12] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:12] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:12] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:12] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:13] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:13] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:13] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:13] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:13] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:13] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:13] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 17/120 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:14] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:14] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:14] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:14] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:14] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:14] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:14] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:14] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:15] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:15] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:15] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:15] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:15] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:15] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:15] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:15] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:16] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:16] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:16] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:16] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:16] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:16] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:16] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:17] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:17] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:17] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:17] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:17] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:17] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:17] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:18] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:18] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:18] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:18] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:18] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:18] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:18] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:18] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:19] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:19] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:19] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:19] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:19] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:19] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:20] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:20] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:20] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:20] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:20] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:20] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:20] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:21] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:21] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:21] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:21] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:21] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:21] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:21] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:22] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:22] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:22] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:22] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:22] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:22] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:23] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:23] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:23] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:23] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:23] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:23] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:24] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:24] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:24] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:24] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:24] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:24] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:24] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 13/197 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 6/180 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/180 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp73 is UNSAT
At refinement iteration 16 (OVERLAPS) 48/228 variables, 28/227 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:26] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:26] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:26] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:26] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:27] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:27] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:27] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:27] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:27] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:28] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:28] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 27 ms to minimize.
Problem AtomicPropp14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:28] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 27 ms to minimize.
Problem AtomicPropp53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:28] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 10 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 13/240 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:29] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:29] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:29] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:29] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:30] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:30] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:30] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:30] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:30] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:31] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:31] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:31] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:31] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:32] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:32] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:32] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:32] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:32] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:33] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:33] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 21 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 20/260 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:33] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:33] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:34] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:34] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:34] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:34] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:34] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:35] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:35] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:35] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:36] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:36] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:36] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:36] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:36] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:37] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:37] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:37] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:37] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:37] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 26 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/228 variables, 20/280 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:38] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:38] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:38] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:38] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:39] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:39] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:39] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:39] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:40] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:40] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:40] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:40] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:40] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:41] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:41] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:41] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:41] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:42] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:42] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:42] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 24 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/228 variables, 20/300 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:42] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:43] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:43] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:43] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:43] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:44] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:44] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:44] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:44] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:44] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:44] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:45] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:45] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:45] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:45] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:45] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:46] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:46] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:46] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:46] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 23 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/228 variables, 20/320 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:47] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:47] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:47] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:47] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:48] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:48] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:48] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:48] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:48] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:49] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 16 ms to minimize.
SMT process timed out in 50464ms, After SMT, problems are : Problem set: 3 solved, 26 unsolved
Fused 26 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 48 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 195/195 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 233 transition count 185
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 220 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 219 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 219 transition count 184
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 33 place count 214 transition count 181
Applied a total of 33 rules in 40 ms. Remains 214 /233 variables (removed 19) and now considering 181/195 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 214/233 places, 181/195 transitions.
RANDOM walk for 40000 steps (2026 resets) in 613 ms. (65 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (36 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (38 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (36 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (38 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (36 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (38 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (36 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (37 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (38 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (34 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (40 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (41 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (37 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (39 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (39 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (38 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (38 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (40 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (37 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (37 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (38 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (37 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (39 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (38 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 538564 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :21 out of 26
Probabilistic random walk after 538564 steps, saw 86556 distinct states, run finished after 3016 ms. (steps per millisecond=178 ) properties seen :21
// Phase 1: matrix 181 rows 214 cols
[2025-05-30 03:09:52] [INFO ] Computed 73 invariants in 3 ms
[2025-05-30 03:09:52] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 63/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 70/145 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5/150 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 57/207 variables, 23/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/209 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 181/390 variables, 209/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 5/395 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/395 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/395 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/395 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 291 constraints, problems are : Problem set: 0 solved, 5 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 214/214 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 63/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:53] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 70/145 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:53] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:53] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:53] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:54] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:54] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:54] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:54] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:54] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:54] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:54] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:54] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/150 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 57/207 variables, 23/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:55] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:55] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/209 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 181/390 variables, 209/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/390 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:55] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:55] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:56] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:56] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:56] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:56] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:56] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 12 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/390 variables, 7/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:56] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:57] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:57] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 26 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/390 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:57] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:57] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:57] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 2 ms to minimize.
Problem AtomicPropp39 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/390 variables, 3/317 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/390 variables, 0/317 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 5/395 variables, 5/322 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/395 variables, 1/323 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/395 variables, 1/324 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem AtomicPropp60 is UNSAT
At refinement iteration 24 (INCLUDED_ONLY) 0/395 variables, 1/325 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/395 variables, 0/325 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/395 variables, 0/325 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 325 constraints, problems are : Problem set: 2 solved, 3 unsolved in 4952 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 214/214 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 5620ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 423 ms.
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 181/181 transitions.
Graph (trivial) has 43 edges and 214 vertex of which 2 / 214 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 213 transition count 174
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 208 transition count 174
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 11 place count 208 transition count 158
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 47 place count 188 transition count 158
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 52 place count 183 transition count 153
Iterating global reduction 2 with 5 rules applied. Total rules applied 57 place count 183 transition count 153
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 97 place count 163 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 163 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 161 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 161 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 160 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 160 transition count 130
Applied a total of 104 rules in 48 ms. Remains 160 /214 variables (removed 54) and now considering 130/181 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 160/214 places, 130/181 transitions.
RANDOM walk for 40000 steps (1909 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (785 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (335 resets) in 116 ms. (341 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (810 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
// Phase 1: matrix 130 rows 160 cols
[2025-05-30 03:09:59] [INFO ] Computed 69 invariants in 4 ms
[2025-05-30 03:09:59] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/54 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/62 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/106 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 44/150 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:59] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:59] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:59] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:59] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:59] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:09:59] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:00] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:00] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/153 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 129/282 variables, 153/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 7/289 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/289 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/290 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/290 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/290 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1440 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 160/160 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/54 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/62 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/106 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 44/150 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/153 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 129/282 variables, 153/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/282 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/289 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/289 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/290 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:00] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/290 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/290 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/290 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 160/160 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2040ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 48 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 10 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2025-05-30 03:10:01] [INFO ] Flatten gal took : 32 ms
[2025-05-30 03:10:01] [INFO ] Flatten gal took : 33 ms
[2025-05-30 03:10:01] [INFO ] Input system was already deterministic with 413 transitions.
Support contains 86 out of 468 places (down from 87) after GAL structural reductions.
Computed a total of 452 stabilizing places and 397 stable transitions
Graph (complete) has 1033 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 446 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 446 transition count 391
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 439 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 439 transition count 384
Applied a total of 58 rules in 29 ms. Remains 439 /468 variables (removed 29) and now considering 384/413 (removed 29) transitions.
// Phase 1: matrix 384 rows 439 cols
[2025-05-30 03:10:01] [INFO ] Computed 91 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:10:01] [INFO ] Implicit Places using invariants in 515 ms returned []
[2025-05-30 03:10:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:10:04] [INFO ] Implicit Places using invariants and state equation in 2454 ms returned []
Implicit Place search using SMT with State Equation took 2971 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2025-05-30 03:10:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:25] [INFO ] Deduced a trap composed of 49 places in 320 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:25] [INFO ] Deduced a trap composed of 52 places in 334 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:25] [INFO ] Deduced a trap composed of 52 places in 328 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:26] [INFO ] Deduced a trap composed of 52 places in 319 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:26] [INFO ] Deduced a trap composed of 52 places in 324 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:26] [INFO ] Deduced a trap composed of 52 places in 323 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:27] [INFO ] Deduced a trap composed of 52 places in 316 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:27] [INFO ] Deduced a trap composed of 52 places in 324 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:27] [INFO ] Deduced a trap composed of 52 places in 313 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:28] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:28] [INFO ] Deduced a trap composed of 52 places in 305 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:28] [INFO ] Deduced a trap composed of 49 places in 296 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:29] [INFO ] Deduced a trap composed of 49 places in 309 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:29] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:29] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:30] [INFO ] Deduced a trap composed of 49 places in 331 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:30] [INFO ] Deduced a trap composed of 49 places in 339 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:30] [INFO ] Deduced a trap composed of 49 places in 311 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:31] [INFO ] Deduced a trap composed of 52 places in 329 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:31] [INFO ] Deduced a trap composed of 52 places in 319 ms of which 58 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:32] [INFO ] Deduced a trap composed of 51 places in 350 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:32] [INFO ] Deduced a trap composed of 51 places in 312 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:33] [INFO ] Deduced a trap composed of 51 places in 313 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:33] [INFO ] Deduced a trap composed of 51 places in 324 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:33] [INFO ] Deduced a trap composed of 51 places in 311 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:34] [INFO ] Deduced a trap composed of 51 places in 318 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:34] [INFO ] Deduced a trap composed of 52 places in 307 ms of which 47 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/823 variables, and 118 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/439 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 27/118 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:41] [INFO ] Deduced a trap composed of 52 places in 342 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:42] [INFO ] Deduced a trap composed of 52 places in 339 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:42] [INFO ] Deduced a trap composed of 52 places in 312 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:42] [INFO ] Deduced a trap composed of 70 places in 351 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:43] [INFO ] Deduced a trap composed of 70 places in 374 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:43] [INFO ] Deduced a trap composed of 70 places in 366 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:44] [INFO ] Deduced a trap composed of 51 places in 348 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:44] [INFO ] Deduced a trap composed of 51 places in 345 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:44] [INFO ] Deduced a trap composed of 52 places in 344 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:45] [INFO ] Deduced a trap composed of 52 places in 309 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:45] [INFO ] Deduced a trap composed of 70 places in 490 ms of which 206 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:46] [INFO ] Deduced a trap composed of 70 places in 332 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:46] [INFO ] Deduced a trap composed of 71 places in 352 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:46] [INFO ] Deduced a trap composed of 51 places in 361 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:47] [INFO ] Deduced a trap composed of 51 places in 353 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:47] [INFO ] Deduced a trap composed of 49 places in 354 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:48] [INFO ] Deduced a trap composed of 52 places in 327 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:48] [INFO ] Deduced a trap composed of 52 places in 350 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:48] [INFO ] Deduced a trap composed of 52 places in 342 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:49] [INFO ] Deduced a trap composed of 52 places in 347 ms of which 64 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:49] [INFO ] Deduced a trap composed of 70 places in 330 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:50] [INFO ] Deduced a trap composed of 70 places in 370 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:50] [INFO ] Deduced a trap composed of 70 places in 352 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:51] [INFO ] Deduced a trap composed of 51 places in 344 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:51] [INFO ] Deduced a trap composed of 47 places in 361 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:52] [INFO ] Deduced a trap composed of 55 places in 344 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:52] [INFO ] Deduced a trap composed of 55 places in 367 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:53] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:53] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:53] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:54] [INFO ] Deduced a trap composed of 21 places in 334 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:54] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:54] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:55] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:56] [INFO ] Deduced a trap composed of 14 places in 388 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:56] [INFO ] Deduced a trap composed of 62 places in 405 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:57] [INFO ] Deduced a trap composed of 57 places in 460 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:57] [INFO ] Deduced a trap composed of 51 places in 406 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:58] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:58] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 18 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/158 constraints. Problems are: Problem set: 4 solved, 379 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:59] [INFO ] Deduced a trap composed of 70 places in 344 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:10:59] [INFO ] Deduced a trap composed of 70 places in 339 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:00] [INFO ] Deduced a trap composed of 70 places in 341 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:00] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:00] [INFO ] Deduced a trap composed of 70 places in 356 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:01] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:01] [INFO ] Deduced a trap composed of 70 places in 323 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:02] [INFO ] Deduced a trap composed of 49 places in 361 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:02] [INFO ] Deduced a trap composed of 49 places in 368 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:02] [INFO ] Deduced a trap composed of 49 places in 346 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:03] [INFO ] Deduced a trap composed of 49 places in 365 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:03] [INFO ] Deduced a trap composed of 49 places in 349 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:03] [INFO ] Deduced a trap composed of 51 places in 331 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:11:04] [INFO ] Deduced a trap composed of 19 places in 301 ms of which 34 ms to minimize.
SMT process timed out in 60157ms, After SMT, problems are : Problem set: 4 solved, 379 unsolved
Search for dead transitions found 4 dead transitions in 60161ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 439/468 places, 380/413 transitions.
Applied a total of 0 rules in 16 ms. Remains 439 /439 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63180 ms. Remains : 439/468 places, 380/413 transitions.
[2025-05-30 03:11:04] [INFO ] Flatten gal took : 40 ms
[2025-05-30 03:11:04] [INFO ] Flatten gal took : 40 ms
[2025-05-30 03:11:04] [INFO ] Input system was already deterministic with 380 transitions.
[2025-05-30 03:11:04] [INFO ] Flatten gal took : 36 ms
[2025-05-30 03:11:04] [INFO ] Flatten gal took : 34 ms
[2025-05-30 03:11:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13476763165545370181.gal : 27 ms
[2025-05-30 03:11:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6359245899791848688.ctl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13476763165545370181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6359245899791848688.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:11:34] [INFO ] Flatten gal took : 21 ms
[2025-05-30 03:11:34] [INFO ] Applying decomposition
[2025-05-30 03:11:34] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1353780700267443435.txt' '-o' '/tmp/graph1353780700267443435.bin' '-w' '/tmp/graph1353780700267443435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1353780700267443435.bin' '-l' '-1' '-v' '-w' '/tmp/graph1353780700267443435.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:11:35] [INFO ] Decomposing Gal with order
[2025-05-30 03:11:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:11:35] [INFO ] Removed a total of 235 redundant transitions.
[2025-05-30 03:11:35] [INFO ] Flatten gal took : 105 ms
[2025-05-30 03:11:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 22 ms.
[2025-05-30 03:11:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3486957304137107519.gal : 20 ms
[2025-05-30 03:11:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7618359144276000048.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3486957304137107519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7618359144276000048.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,2.83706,88488,5259,55,119044,717,903,703255,52,1935,0
Converting to forward existential form...Done !
original formula: (!(A((((AF((i15.u116.p385==1)) + A((((i4.u46.p139==1)&&(i14.u104.p331==1))&&(i16.u122.p528==1)) U (i0.u37.p111==1))) + (i0.u129.p460==1))...293
=> equivalent forward existential formula: ([((Init * !(EG(!((i13.u144.p532==1))))) * !(E(!((i13.u144.p532==1)) U (!((((!(EG(!((i15.u116.p385==1)))) + !((E...519
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t151, t163, t175, t187, t195, t211, t219, t223, t241, t249, t372, t373, t375,...1114
(forward)formula 0,0,9.85172,292008,1,0,364935,745,7429,2.46807e+06,249,2735,867363
FORMULA BusinessProcesses-PT-11-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 446 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 446 transition count 391
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 439 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 439 transition count 384
Applied a total of 58 rules in 30 ms. Remains 439 /468 variables (removed 29) and now considering 384/413 (removed 29) transitions.
// Phase 1: matrix 384 rows 439 cols
[2025-05-30 03:11:45] [INFO ] Computed 91 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:11:45] [INFO ] Implicit Places using invariants in 429 ms returned []
[2025-05-30 03:11:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:11:47] [INFO ] Implicit Places using invariants and state equation in 2131 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2025-05-30 03:11:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:08] [INFO ] Deduced a trap composed of 49 places in 346 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:08] [INFO ] Deduced a trap composed of 70 places in 347 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:09] [INFO ] Deduced a trap composed of 70 places in 379 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:09] [INFO ] Deduced a trap composed of 70 places in 336 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:10] [INFO ] Deduced a trap composed of 70 places in 333 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:10] [INFO ] Deduced a trap composed of 49 places in 330 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:10] [INFO ] Deduced a trap composed of 49 places in 346 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:11] [INFO ] Deduced a trap composed of 49 places in 330 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:11] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:11] [INFO ] Deduced a trap composed of 49 places in 300 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:12] [INFO ] Deduced a trap composed of 70 places in 339 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:12] [INFO ] Deduced a trap composed of 70 places in 341 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:12] [INFO ] Deduced a trap composed of 49 places in 322 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:13] [INFO ] Deduced a trap composed of 70 places in 340 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:13] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:13] [INFO ] Deduced a trap composed of 50 places in 322 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:14] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:14] [INFO ] Deduced a trap composed of 50 places in 351 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:15] [INFO ] Deduced a trap composed of 68 places in 356 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:15] [INFO ] Deduced a trap composed of 63 places in 345 ms of which 70 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:16] [INFO ] Deduced a trap composed of 52 places in 326 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:16] [INFO ] Deduced a trap composed of 51 places in 337 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:17] [INFO ] Deduced a trap composed of 51 places in 334 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:17] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:17] [INFO ] Deduced a trap composed of 49 places in 335 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:17] [INFO ] Deduced a trap composed of 49 places in 316 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:12:18] [INFO ] Deduced a trap composed of 49 places in 317 ms of which 51 ms to minimize.
SMT process timed out in 30320ms, After SMT, problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 30323ms
Starting structural reductions in LTL mode, iteration 1 : 439/468 places, 384/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32918 ms. Remains : 439/468 places, 384/413 transitions.
[2025-05-30 03:12:18] [INFO ] Flatten gal took : 24 ms
[2025-05-30 03:12:18] [INFO ] Flatten gal took : 25 ms
[2025-05-30 03:12:18] [INFO ] Input system was already deterministic with 384 transitions.
[2025-05-30 03:12:18] [INFO ] Flatten gal took : 24 ms
[2025-05-30 03:12:18] [INFO ] Flatten gal took : 22 ms
[2025-05-30 03:12:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9812981341508645835.gal : 6 ms
[2025-05-30 03:12:18] [INFO ] Time to serialize properties into /tmp/CTLFireability7615938273883288014.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9812981341508645835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7615938273883288014.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:12:48] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:12:48] [INFO ] Applying decomposition
[2025-05-30 03:12:48] [INFO ] Flatten gal took : 14 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/graph9894905840168408246.txt' '-o' '/tmp/graph9894905840168408246.bin' '-w' '/tmp/graph9894905840168408246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9894905840168408246.bin' '-l' '-1' '-v' '-w' '/tmp/graph9894905840168408246.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:12:48] [INFO ] Decomposing Gal with order
[2025-05-30 03:12:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:12:48] [INFO ] Removed a total of 249 redundant transitions.
[2025-05-30 03:12:48] [INFO ] Flatten gal took : 37 ms
[2025-05-30 03:12:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-05-30 03:12:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15607136629332129510.gal : 8 ms
[2025-05-30 03:12:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7782556821936448840.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15607136629332129510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7782556821936448840.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,1.71423,45684,5367,59,69014,569,1020,214453,66,1503,0
Converting to forward existential form...Done !
original formula: (EG(!(E(!(EG((i16.u139.p513==1))) U ((i5.i0.u23.p67==1) * EF((i5.i0.u149.p547==1)))))) * EX((((i10.i0.u42.p130==0) + AX(EX((((i15.u63.p18...229
=> equivalent forward existential formula: (([(EY((Init * EG(!(E(!(EG((i16.u139.p513==1))) U ((i5.i0.u23.p67==1) * E(TRUE U (i5.i0.u149.p547==1)))))))) * (...533
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t151, t159, t171, t179, t187, t199, t211, t219, t223, t241, t249, t375, t376,...1188
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 446 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 446 transition count 391
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 439 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 439 transition count 384
Applied a total of 58 rules in 31 ms. Remains 439 /468 variables (removed 29) and now considering 384/413 (removed 29) transitions.
// Phase 1: matrix 384 rows 439 cols
[2025-05-30 03:13:18] [INFO ] Computed 91 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:13:19] [INFO ] Implicit Places using invariants in 425 ms returned []
[2025-05-30 03:13:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:13:21] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2025-05-30 03:13:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:43] [INFO ] Deduced a trap composed of 49 places in 340 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:43] [INFO ] Deduced a trap composed of 49 places in 321 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:44] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:44] [INFO ] Deduced a trap composed of 49 places in 314 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:44] [INFO ] Deduced a trap composed of 49 places in 326 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:45] [INFO ] Deduced a trap composed of 49 places in 317 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:45] [INFO ] Deduced a trap composed of 49 places in 320 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:45] [INFO ] Deduced a trap composed of 49 places in 316 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:46] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:46] [INFO ] Deduced a trap composed of 49 places in 311 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:46] [INFO ] Deduced a trap composed of 49 places in 309 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:47] [INFO ] Deduced a trap composed of 49 places in 319 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:47] [INFO ] Deduced a trap composed of 70 places in 353 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:47] [INFO ] Deduced a trap composed of 70 places in 342 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:48] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:48] [INFO ] Deduced a trap composed of 70 places in 338 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:48] [INFO ] Deduced a trap composed of 70 places in 312 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:49] [INFO ] Deduced a trap composed of 70 places in 276 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:49] [INFO ] Deduced a trap composed of 70 places in 342 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:50] [INFO ] Deduced a trap composed of 70 places in 354 ms of which 75 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:50] [INFO ] Deduced a trap composed of 53 places in 298 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:51] [INFO ] Deduced a trap composed of 70 places in 321 ms of which 69 ms to minimize.
SMT process timed out in 30111ms, After SMT, problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 30113ms
Starting structural reductions in LTL mode, iteration 1 : 439/468 places, 384/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32526 ms. Remains : 439/468 places, 384/413 transitions.
[2025-05-30 03:13:51] [INFO ] Flatten gal took : 22 ms
[2025-05-30 03:13:51] [INFO ] Flatten gal took : 22 ms
[2025-05-30 03:13:51] [INFO ] Input system was already deterministic with 384 transitions.
[2025-05-30 03:13:51] [INFO ] Flatten gal took : 12 ms
[2025-05-30 03:13:51] [INFO ] Flatten gal took : 12 ms
[2025-05-30 03:13:51] [INFO ] Time to serialize gal into /tmp/CTLFireability4975736306384633010.gal : 3 ms
[2025-05-30 03:13:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13900722374172937881.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4975736306384633010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13900722374172937881.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:14:21] [INFO ] Flatten gal took : 13 ms
[2025-05-30 03:14:21] [INFO ] Applying decomposition
[2025-05-30 03:14:21] [INFO ] Flatten gal took : 12 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/graph17952821665855222224.txt' '-o' '/tmp/graph17952821665855222224.bin' '-w' '/tmp/graph17952821665855222224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17952821665855222224.bin' '-l' '-1' '-v' '-w' '/tmp/graph17952821665855222224.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:14:21] [INFO ] Decomposing Gal with order
[2025-05-30 03:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:14:21] [INFO ] Removed a total of 247 redundant transitions.
[2025-05-30 03:14:21] [INFO ] Flatten gal took : 39 ms
[2025-05-30 03:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 14 ms.
[2025-05-30 03:14:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10747203598794138442.gal : 7 ms
[2025-05-30 03:14:21] [INFO ] Time to serialize properties into /tmp/CTLFireability458056950880724005.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10747203598794138442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability458056950880724005.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.19631e+22,1.49111,37456,3461,59,64148,756,1026,159661,69,1749,0
Converting to forward existential form...Done !
original formula: (EX(!(E((AF((i6.u9.p22==1)) + EF((i1.i0.u2.p8==1))) U EG((i14.u119.p493==1))))) * EX(EF(AX((i9.i2.u110.p359==1)))))
=> equivalent forward existential formula: [(FwdU(EY((Init * EX(!(E((!(EG(!((i6.u9.p22==1)))) + E(TRUE U (i1.i0.u2.p8==1))) U EG((i14.u119.p493==1))))))),T...203
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t151, t163, t171, t187, t195, t207, t215, t223, t249, t375, t377, t379, i0.i0...1197
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 446 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 446 transition count 391
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 440 transition count 385
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 440 transition count 385
Applied a total of 56 rules in 32 ms. Remains 440 /468 variables (removed 28) and now considering 385/413 (removed 28) transitions.
// Phase 1: matrix 385 rows 440 cols
[2025-05-30 03:14:51] [INFO ] Computed 91 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:14:52] [INFO ] Implicit Places using invariants in 445 ms returned []
[2025-05-30 03:14:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:14:54] [INFO ] Implicit Places using invariants and state equation in 2433 ms returned []
Implicit Place search using SMT with State Equation took 2882 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2025-05-30 03:14:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:16] [INFO ] Deduced a trap composed of 51 places in 353 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:17] [INFO ] Deduced a trap composed of 51 places in 310 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:17] [INFO ] Deduced a trap composed of 54 places in 327 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:17] [INFO ] Deduced a trap composed of 54 places in 337 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:18] [INFO ] Deduced a trap composed of 54 places in 336 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:18] [INFO ] Deduced a trap composed of 72 places in 349 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:18] [INFO ] Deduced a trap composed of 72 places in 345 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:19] [INFO ] Deduced a trap composed of 72 places in 324 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:19] [INFO ] Deduced a trap composed of 72 places in 297 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:19] [INFO ] Deduced a trap composed of 72 places in 288 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:20] [INFO ] Deduced a trap composed of 72 places in 279 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:20] [INFO ] Deduced a trap composed of 72 places in 268 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:20] [INFO ] Deduced a trap composed of 72 places in 249 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:20] [INFO ] Deduced a trap composed of 72 places in 256 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:21] [INFO ] Deduced a trap composed of 72 places in 311 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:21] [INFO ] Deduced a trap composed of 72 places in 328 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:21] [INFO ] Deduced a trap composed of 72 places in 337 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:22] [INFO ] Deduced a trap composed of 75 places in 346 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:22] [INFO ] Deduced a trap composed of 75 places in 336 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:22] [INFO ] Deduced a trap composed of 75 places in 341 ms of which 72 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:23] [INFO ] Deduced a trap composed of 51 places in 356 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:24] [INFO ] Deduced a trap composed of 51 places in 344 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:24] [INFO ] Deduced a trap composed of 51 places in 327 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:15:24] [INFO ] Deduced a trap composed of 51 places in 247 ms of which 29 ms to minimize.
SMT process timed out in 30168ms, After SMT, problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 30169ms
Starting structural reductions in LTL mode, iteration 1 : 440/468 places, 385/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33085 ms. Remains : 440/468 places, 385/413 transitions.
[2025-05-30 03:15:24] [INFO ] Flatten gal took : 18 ms
[2025-05-30 03:15:24] [INFO ] Flatten gal took : 20 ms
[2025-05-30 03:15:24] [INFO ] Input system was already deterministic with 385 transitions.
[2025-05-30 03:15:24] [INFO ] Flatten gal took : 20 ms
[2025-05-30 03:15:24] [INFO ] Flatten gal took : 20 ms
[2025-05-30 03:15:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4383922082660605111.gal : 5 ms
[2025-05-30 03:15:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6661791922784442302.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4383922082660605111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6661791922784442302.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:15:55] [INFO ] Flatten gal took : 11 ms
[2025-05-30 03:15:55] [INFO ] Applying decomposition
[2025-05-30 03:15:55] [INFO ] Flatten gal took : 10 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/graph14807461534045179835.txt' '-o' '/tmp/graph14807461534045179835.bin' '-w' '/tmp/graph14807461534045179835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14807461534045179835.bin' '-l' '-1' '-v' '-w' '/tmp/graph14807461534045179835.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:15:55] [INFO ] Decomposing Gal with order
[2025-05-30 03:15:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:15:55] [INFO ] Removed a total of 247 redundant transitions.
[2025-05-30 03:15:55] [INFO ] Flatten gal took : 42 ms
[2025-05-30 03:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2025-05-30 03:15:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15273450160184573020.gal : 7 ms
[2025-05-30 03:15:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17853462534224190407.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15273450160184573020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17853462534224190407.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.19631e+22,1.02434,27176,3675,57,47258,722,1072,97558,63,1647,0
Converting to forward existential form...Done !
original formula: AX(AG(((E(AX(((i4.i0.u22.p79==1)&&(i4.i0.u124.p455==1))) U ((i6.i0.u129.p484==1)||(i14.u135.p504==1))) + EG(AG((i4.i2.u30.p67==1)))) + (i...176
=> equivalent forward existential formula: [(((FwdU(EY(Init),TRUE) * !((i12.i1.u85.p256==0))) * !(EG(!(E(TRUE U !((i4.i2.u30.p67==1))))))) * !(E(!(EX(!(((i...254
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t152, t160, t172, t180, t192, t200, t216, t224, t242, t250, t376, t377, t378,...1224
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,7.56491,196648,1,0,405556,1047,8036,916053,349,2951,773497
FORMULA BusinessProcesses-PT-11-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 445 transition count 390
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 438 transition count 383
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 438 transition count 383
Applied a total of 60 rules in 29 ms. Remains 438 /468 variables (removed 30) and now considering 383/413 (removed 30) transitions.
// Phase 1: matrix 383 rows 438 cols
[2025-05-30 03:16:02] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:16:03] [INFO ] Implicit Places using invariants in 371 ms returned []
[2025-05-30 03:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:16:05] [INFO ] Implicit Places using invariants and state equation in 2361 ms returned []
Implicit Place search using SMT with State Equation took 2741 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2025-05-30 03:16:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:27] [INFO ] Deduced a trap composed of 49 places in 309 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:27] [INFO ] Deduced a trap composed of 52 places in 313 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:28] [INFO ] Deduced a trap composed of 52 places in 282 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:28] [INFO ] Deduced a trap composed of 52 places in 313 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:28] [INFO ] Deduced a trap composed of 52 places in 320 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:29] [INFO ] Deduced a trap composed of 52 places in 317 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:29] [INFO ] Deduced a trap composed of 52 places in 317 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:29] [INFO ] Deduced a trap composed of 52 places in 316 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:30] [INFO ] Deduced a trap composed of 52 places in 323 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:30] [INFO ] Deduced a trap composed of 52 places in 330 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:30] [INFO ] Deduced a trap composed of 70 places in 341 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:31] [INFO ] Deduced a trap composed of 70 places in 333 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:31] [INFO ] Deduced a trap composed of 70 places in 337 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:31] [INFO ] Deduced a trap composed of 70 places in 327 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:32] [INFO ] Deduced a trap composed of 73 places in 336 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:32] [INFO ] Deduced a trap composed of 73 places in 335 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:32] [INFO ] Deduced a trap composed of 73 places in 324 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:33] [INFO ] Deduced a trap composed of 73 places in 329 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:33] [INFO ] Deduced a trap composed of 73 places in 325 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:34] [INFO ] Deduced a trap composed of 73 places in 323 ms of which 66 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:34] [INFO ] Deduced a trap composed of 73 places in 303 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:35] [INFO ] Deduced a trap composed of 73 places in 317 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:35] [INFO ] Deduced a trap composed of 73 places in 348 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:16:35] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 63 ms to minimize.
SMT process timed out in 30267ms, After SMT, problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 30269ms
Starting structural reductions in LTL mode, iteration 1 : 438/468 places, 383/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33041 ms. Remains : 438/468 places, 383/413 transitions.
[2025-05-30 03:16:35] [INFO ] Flatten gal took : 19 ms
[2025-05-30 03:16:35] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:16:35] [INFO ] Input system was already deterministic with 383 transitions.
[2025-05-30 03:16:35] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:16:35] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:16:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1667026906834423858.gal : 4 ms
[2025-05-30 03:16:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3739772382912698823.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1667026906834423858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3739772382912698823.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:17:06] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:17:06] [INFO ] Applying decomposition
[2025-05-30 03:17:06] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13659174134193400575.txt' '-o' '/tmp/graph13659174134193400575.bin' '-w' '/tmp/graph13659174134193400575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13659174134193400575.bin' '-l' '-1' '-v' '-w' '/tmp/graph13659174134193400575.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:17:06] [INFO ] Decomposing Gal with order
[2025-05-30 03:17:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:17:06] [INFO ] Removed a total of 247 redundant transitions.
[2025-05-30 03:17:06] [INFO ] Flatten gal took : 25 ms
[2025-05-30 03:17:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2025-05-30 03:17:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13734840043721449479.gal : 6 ms
[2025-05-30 03:17:06] [INFO ] Time to serialize properties into /tmp/CTLFireability491784829500158030.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13734840043721449479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability491784829500158030.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,1.11026,29056,3013,78,52063,1282,1030,95012,70,2980,0
Converting to forward existential form...Done !
original formula: AX(AG(EF((i5.u10.p24==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (i5.u10.p24==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t150, t162, t170, t174, t186, t194, t206, t210, t218, t222, t248, t375, t376,...1213
(forward)formula 0,0,4.41358,114688,1,0,220185,1843,7578,433756,350,4518,591166
FORMULA BusinessProcesses-PT-11-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 446 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 446 transition count 391
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 440 transition count 385
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 440 transition count 385
Applied a total of 56 rules in 28 ms. Remains 440 /468 variables (removed 28) and now considering 385/413 (removed 28) transitions.
// Phase 1: matrix 385 rows 440 cols
[2025-05-30 03:17:10] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:17:11] [INFO ] Implicit Places using invariants in 404 ms returned []
[2025-05-30 03:17:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:17:12] [INFO ] Implicit Places using invariants and state equation in 1939 ms returned []
Implicit Place search using SMT with State Equation took 2344 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2025-05-30 03:17:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:35] [INFO ] Deduced a trap composed of 51 places in 331 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:35] [INFO ] Deduced a trap composed of 72 places in 334 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:36] [INFO ] Deduced a trap composed of 72 places in 342 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:36] [INFO ] Deduced a trap composed of 72 places in 339 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:36] [INFO ] Deduced a trap composed of 72 places in 326 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:37] [INFO ] Deduced a trap composed of 72 places in 330 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:37] [INFO ] Deduced a trap composed of 72 places in 331 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:37] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:38] [INFO ] Deduced a trap composed of 72 places in 333 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:38] [INFO ] Deduced a trap composed of 51 places in 323 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:38] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:39] [INFO ] Deduced a trap composed of 72 places in 312 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:39] [INFO ] Deduced a trap composed of 72 places in 330 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:39] [INFO ] Deduced a trap composed of 72 places in 325 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:40] [INFO ] Deduced a trap composed of 51 places in 324 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:40] [INFO ] Deduced a trap composed of 72 places in 342 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:40] [INFO ] Deduced a trap composed of 54 places in 317 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:41] [INFO ] Deduced a trap composed of 54 places in 321 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:41] [INFO ] Deduced a trap composed of 53 places in 321 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:41] [INFO ] Deduced a trap composed of 53 places in 329 ms of which 63 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:42] [INFO ] Deduced a trap composed of 72 places in 305 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:42] [INFO ] Deduced a trap composed of 72 places in 320 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:17:43] [INFO ] Deduced a trap composed of 72 places in 335 ms of which 74 ms to minimize.
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 30304ms
Starting structural reductions in LTL mode, iteration 1 : 440/468 places, 385/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32678 ms. Remains : 440/468 places, 385/413 transitions.
[2025-05-30 03:17:43] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:17:43] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:17:43] [INFO ] Input system was already deterministic with 385 transitions.
[2025-05-30 03:17:43] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:17:43] [INFO ] Flatten gal took : 17 ms
[2025-05-30 03:17:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9326147964685265468.gal : 4 ms
[2025-05-30 03:17:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7338404141509910246.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9326147964685265468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7338404141509910246.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:18:13] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:18:13] [INFO ] Applying decomposition
[2025-05-30 03:18:13] [INFO ] Flatten gal took : 10 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/graph5836134182833920012.txt' '-o' '/tmp/graph5836134182833920012.bin' '-w' '/tmp/graph5836134182833920012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5836134182833920012.bin' '-l' '-1' '-v' '-w' '/tmp/graph5836134182833920012.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:18:13] [INFO ] Decomposing Gal with order
[2025-05-30 03:18:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:18:13] [INFO ] Removed a total of 247 redundant transitions.
[2025-05-30 03:18:13] [INFO ] Flatten gal took : 24 ms
[2025-05-30 03:18:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-05-30 03:18:13] [INFO ] Time to serialize gal into /tmp/CTLFireability3438406768732467477.gal : 6 ms
[2025-05-30 03:18:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12999088124324108921.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3438406768732467477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12999088124324108921.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.38397e+22,0.87565,26628,3976,73,40349,1370,1014,87464,70,3067,0
Converting to forward existential form...Done !
original formula: (EG((EF(AX(EF((((i1.u71.p217==1)&&(i9.u114.p392==1))&&(i1.u139.p520==1))))) * A(EG((i16.u120.p426==1)) U !(((i2.i0.u131.p488!=1)&&(i4.u10...358
=> equivalent forward existential formula: [FwdG((Init * EG((E(TRUE U !(EX(!(E(TRUE U (((i1.u71.p217==1)&&(i9.u114.p392==1))&&(i1.u139.p520==1))))))) * !((...532
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t152, t164, t172, t176, t192, t200, t208, t212, t224, t250, t376, t378, t380,...1159
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 445 transition count 390
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 438 transition count 383
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 438 transition count 383
Applied a total of 60 rules in 30 ms. Remains 438 /468 variables (removed 30) and now considering 383/413 (removed 30) transitions.
// Phase 1: matrix 383 rows 438 cols
[2025-05-30 03:18:43] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:18:44] [INFO ] Implicit Places using invariants in 499 ms returned []
[2025-05-30 03:18:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:18:46] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 2650 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2025-05-30 03:18:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:07] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:08] [INFO ] Deduced a trap composed of 52 places in 308 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:08] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:08] [INFO ] Deduced a trap composed of 52 places in 308 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:09] [INFO ] Deduced a trap composed of 52 places in 269 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:09] [INFO ] Deduced a trap composed of 52 places in 273 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:09] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:09] [INFO ] Deduced a trap composed of 52 places in 253 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:10] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:10] [INFO ] Deduced a trap composed of 52 places in 266 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:10] [INFO ] Deduced a trap composed of 70 places in 344 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:11] [INFO ] Deduced a trap composed of 70 places in 337 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:11] [INFO ] Deduced a trap composed of 70 places in 339 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:11] [INFO ] Deduced a trap composed of 70 places in 339 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:12] [INFO ] Deduced a trap composed of 73 places in 332 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:12] [INFO ] Deduced a trap composed of 73 places in 331 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:12] [INFO ] Deduced a trap composed of 73 places in 339 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:13] [INFO ] Deduced a trap composed of 73 places in 321 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:13] [INFO ] Deduced a trap composed of 73 places in 312 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:13] [INFO ] Deduced a trap composed of 73 places in 303 ms of which 66 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:14] [INFO ] Deduced a trap composed of 73 places in 305 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:15] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:15] [INFO ] Deduced a trap composed of 73 places in 361 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:15] [INFO ] Deduced a trap composed of 73 places in 336 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:16] [INFO ] Deduced a trap composed of 73 places in 340 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:16] [INFO ] Deduced a trap composed of 73 places in 360 ms of which 75 ms to minimize.
SMT process timed out in 30157ms, After SMT, problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 30158ms
Starting structural reductions in LTL mode, iteration 1 : 438/468 places, 383/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32840 ms. Remains : 438/468 places, 383/413 transitions.
[2025-05-30 03:19:16] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:19:16] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:19:16] [INFO ] Input system was already deterministic with 383 transitions.
[2025-05-30 03:19:16] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:19:16] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:19:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15748736087059568236.gal : 3 ms
[2025-05-30 03:19:16] [INFO ] Time to serialize properties into /tmp/CTLFireability9546570441748846208.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15748736087059568236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9546570441748846208.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:19:46] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:19:46] [INFO ] Applying decomposition
[2025-05-30 03:19:46] [INFO ] Flatten gal took : 10 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/graph9381962789181426753.txt' '-o' '/tmp/graph9381962789181426753.bin' '-w' '/tmp/graph9381962789181426753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9381962789181426753.bin' '-l' '-1' '-v' '-w' '/tmp/graph9381962789181426753.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:19:46] [INFO ] Decomposing Gal with order
[2025-05-30 03:19:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:19:46] [INFO ] Removed a total of 248 redundant transitions.
[2025-05-30 03:19:46] [INFO ] Flatten gal took : 23 ms
[2025-05-30 03:19:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2025-05-30 03:19:46] [INFO ] Time to serialize gal into /tmp/CTLFireability6026525212450279357.gal : 10 ms
[2025-05-30 03:19:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5521942459542042590.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6026525212450279357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5521942459542042590.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,1.32361,35496,3510,52,58771,755,1036,154052,65,1652,0
Converting to forward existential form...Done !
original formula: AX((i6.i2.u75.p224!=1))
=> equivalent forward existential formula: [(EY(Init) * !((i6.i2.u75.p224!=1)))] = FALSE
(forward)formula 0,1,1.34569,35624,1,0,58771,755,1502,154052,78,1652,2329
FORMULA BusinessProcesses-PT-11-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Graph (trivial) has 226 edges and 468 vertex of which 7 / 468 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1026 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 460 transition count 346
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 402 transition count 346
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 118 place count 402 transition count 252
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 324 place count 290 transition count 252
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 345 place count 269 transition count 231
Iterating global reduction 2 with 21 rules applied. Total rules applied 366 place count 269 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 366 place count 269 transition count 229
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 370 place count 267 transition count 229
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 577 place count 163 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 578 place count 162 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 579 place count 161 transition count 125
Applied a total of 579 rules in 59 ms. Remains 161 /468 variables (removed 307) and now considering 125/413 (removed 288) transitions.
// Phase 1: matrix 125 rows 161 cols
[2025-05-30 03:19:48] [INFO ] Computed 71 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:19:48] [INFO ] Implicit Places using invariants in 273 ms returned [0, 4, 5, 28, 29, 30, 31, 38, 39, 40, 48, 49, 50, 51, 52, 53, 54]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 277 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 144/468 places, 125/413 transitions.
Applied a total of 0 rules in 14 ms. Remains 144 /144 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 351 ms. Remains : 144/468 places, 125/413 transitions.
[2025-05-30 03:19:48] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:19:48] [INFO ] Flatten gal took : 11 ms
[2025-05-30 03:19:48] [INFO ] Input system was already deterministic with 125 transitions.
[2025-05-30 03:19:48] [INFO ] Flatten gal took : 21 ms
[2025-05-30 03:19:48] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:19:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16104324753586630485.gal : 1 ms
[2025-05-30 03:19:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1020709102583699371.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16104324753586630485.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1020709102583699371.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1020709102583699371.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
RANDOM walk for 31219 steps (5380 resets) in 441 ms. (70 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-11-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 54
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :54 after 108
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108 after 360
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in SI_CTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Graph (trivial) has 227 edges and 468 vertex of which 7 / 468 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1026 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 460 transition count 346
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 402 transition count 346
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 118 place count 402 transition count 251
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 326 place count 289 transition count 251
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 347 place count 268 transition count 230
Iterating global reduction 2 with 21 rules applied. Total rules applied 368 place count 268 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 368 place count 268 transition count 228
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 372 place count 266 transition count 228
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 581 place count 160 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 582 place count 159 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 583 place count 158 transition count 124
Applied a total of 583 rules in 70 ms. Remains 158 /468 variables (removed 310) and now considering 124/413 (removed 289) transitions.
// Phase 1: matrix 124 rows 158 cols
[2025-05-30 03:19:48] [INFO ] Computed 69 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:19:49] [INFO ] Implicit Places using invariants in 217 ms returned [7, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 218 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 143/468 places, 124/413 transitions.
Applied a total of 0 rules in 12 ms. Remains 143 /143 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 300 ms. Remains : 143/468 places, 124/413 transitions.
[2025-05-30 03:19:49] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:19:49] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:19:49] [INFO ] Input system was already deterministic with 124 transitions.
[2025-05-30 03:19:49] [INFO ] Flatten gal took : 7 ms
[2025-05-30 03:19:49] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:19:49] [INFO ] Time to serialize gal into /tmp/CTLFireability15435159042645604760.gal : 1 ms
[2025-05-30 03:19:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7213286208270611255.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15435159042645604760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7213286208270611255.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,13760,0.206023,8824,2,2825,5,15638,6,0,694,12601,0
Converting to forward existential form...Done !
original formula: EF(AG((p24==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p24==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t23, t24, t25, t26, t27, t52, t53, t54, t55, t56, t68, t81, t82, t83, t94, t98, t99, t100...263
(forward)formula 0,1,1.15869,36764,1,0,165,131463,233,84,5094,81935,224
FORMULA BusinessProcesses-PT-11-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 448 transition count 393
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 448 transition count 393
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 444 transition count 389
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 444 transition count 389
Applied a total of 48 rules in 27 ms. Remains 444 /468 variables (removed 24) and now considering 389/413 (removed 24) transitions.
// Phase 1: matrix 389 rows 444 cols
[2025-05-30 03:19:50] [INFO ] Computed 91 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:19:50] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-05-30 03:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:19:52] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
Running 388 sub problems to find dead transitions.
[2025-05-30 03:19:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 1/444 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:15] [INFO ] Deduced a trap composed of 50 places in 346 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:15] [INFO ] Deduced a trap composed of 53 places in 331 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:16] [INFO ] Deduced a trap composed of 53 places in 324 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:16] [INFO ] Deduced a trap composed of 53 places in 324 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:16] [INFO ] Deduced a trap composed of 53 places in 310 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:17] [INFO ] Deduced a trap composed of 71 places in 330 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:17] [INFO ] Deduced a trap composed of 71 places in 333 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:17] [INFO ] Deduced a trap composed of 71 places in 327 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:18] [INFO ] Deduced a trap composed of 71 places in 304 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:18] [INFO ] Deduced a trap composed of 71 places in 338 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:19] [INFO ] Deduced a trap composed of 53 places in 367 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:19] [INFO ] Deduced a trap composed of 50 places in 366 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:19] [INFO ] Deduced a trap composed of 53 places in 342 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:20] [INFO ] Deduced a trap composed of 50 places in 362 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:20] [INFO ] Deduced a trap composed of 50 places in 348 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:21] [INFO ] Deduced a trap composed of 50 places in 365 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:21] [INFO ] Deduced a trap composed of 50 places in 362 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:21] [INFO ] Deduced a trap composed of 50 places in 368 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:22] [INFO ] Deduced a trap composed of 52 places in 346 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:22] [INFO ] Deduced a trap composed of 52 places in 353 ms of which 62 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/833 variables, and 111 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 1/444 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:29] [INFO ] Deduced a trap composed of 52 places in 248 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:30] [INFO ] Deduced a trap composed of 71 places in 348 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:30] [INFO ] Deduced a trap composed of 71 places in 338 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:31] [INFO ] Deduced a trap composed of 50 places in 319 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:31] [INFO ] Deduced a trap composed of 53 places in 342 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:31] [INFO ] Deduced a trap composed of 53 places in 343 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:32] [INFO ] Deduced a trap composed of 53 places in 327 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:32] [INFO ] Deduced a trap composed of 22 places in 324 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:33] [INFO ] Deduced a trap composed of 52 places in 345 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:33] [INFO ] Deduced a trap composed of 52 places in 361 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:33] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:34] [INFO ] Deduced a trap composed of 69 places in 346 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:34] [INFO ] Deduced a trap composed of 69 places in 333 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:34] [INFO ] Deduced a trap composed of 52 places in 364 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:35] [INFO ] Deduced a trap composed of 56 places in 357 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:35] [INFO ] Deduced a trap composed of 56 places in 350 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:36] [INFO ] Deduced a trap composed of 51 places in 349 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:36] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:37] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:37] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:38] [INFO ] Deduced a trap composed of 73 places in 308 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:39] [INFO ] Deduced a trap composed of 73 places in 316 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:39] [INFO ] Deduced a trap composed of 73 places in 393 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:39] [INFO ] Deduced a trap composed of 68 places in 345 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:40] [INFO ] Deduced a trap composed of 73 places in 365 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:40] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:40] [INFO ] Deduced a trap composed of 71 places in 316 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:41] [INFO ] Deduced a trap composed of 71 places in 304 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:41] [INFO ] Deduced a trap composed of 71 places in 315 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:41] [INFO ] Deduced a trap composed of 70 places in 298 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:42] [INFO ] Deduced a trap composed of 66 places in 285 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:42] [INFO ] Deduced a trap composed of 71 places in 313 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:42] [INFO ] Deduced a trap composed of 66 places in 275 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:43] [INFO ] Deduced a trap composed of 71 places in 292 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:43] [INFO ] Deduced a trap composed of 71 places in 275 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:44] [INFO ] Deduced a trap composed of 70 places in 504 ms of which 217 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:44] [INFO ] Deduced a trap composed of 70 places in 471 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:44] [INFO ] Deduced a trap composed of 70 places in 389 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:45] [INFO ] Deduced a trap composed of 65 places in 364 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:45] [INFO ] Deduced a trap composed of 70 places in 356 ms of which 82 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:46] [INFO ] Deduced a trap composed of 74 places in 313 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:46] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:47] [INFO ] Deduced a trap composed of 74 places in 311 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:47] [INFO ] Deduced a trap composed of 74 places in 338 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:47] [INFO ] Deduced a trap composed of 74 places in 358 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:48] [INFO ] Deduced a trap composed of 72 places in 371 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:48] [INFO ] Deduced a trap composed of 72 places in 337 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:49] [INFO ] Deduced a trap composed of 71 places in 337 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:49] [INFO ] Deduced a trap composed of 66 places in 314 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:49] [INFO ] Deduced a trap composed of 66 places in 336 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:50] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:50] [INFO ] Deduced a trap composed of 71 places in 330 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:50] [INFO ] Deduced a trap composed of 67 places in 332 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:51] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:51] [INFO ] Deduced a trap composed of 67 places in 335 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:51] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:52] [INFO ] Deduced a trap composed of 67 places in 328 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:52] [INFO ] Deduced a trap composed of 67 places in 329 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:52] [INFO ] Deduced a trap composed of 72 places in 338 ms of which 66 ms to minimize.
SMT process timed out in 60148ms, After SMT, problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 444/468 places, 389/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62574 ms. Remains : 444/468 places, 389/413 transitions.
[2025-05-30 03:20:52] [INFO ] Flatten gal took : 22 ms
[2025-05-30 03:20:52] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:20:52] [INFO ] Input system was already deterministic with 389 transitions.
[2025-05-30 03:20:52] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:20:53] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:20:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16861026369647300424.gal : 4 ms
[2025-05-30 03:20:53] [INFO ] Time to serialize properties into /tmp/CTLFireability2268525024766771533.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16861026369647300424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2268525024766771533.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:21:23] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:21:23] [INFO ] Applying decomposition
[2025-05-30 03:21:23] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10043111221361295785.txt' '-o' '/tmp/graph10043111221361295785.bin' '-w' '/tmp/graph10043111221361295785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10043111221361295785.bin' '-l' '-1' '-v' '-w' '/tmp/graph10043111221361295785.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:21:23] [INFO ] Decomposing Gal with order
[2025-05-30 03:21:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:21:23] [INFO ] Removed a total of 252 redundant transitions.
[2025-05-30 03:21:23] [INFO ] Flatten gal took : 36 ms
[2025-05-30 03:21:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 03:21:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2883824720028726006.gal : 6 ms
[2025-05-30 03:21:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17459499990679873797.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2883824720028726006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17459499990679873797.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.35534e+22,1.60883,40548,4734,40,67435,485,1045,149198,50,1286,0
Converting to forward existential form...Done !
original formula: E((!(A(AX(!((((i2.u43.p126==1)&&(i3.i1.u102.p317==1))&&(i2.u132.p469==1)))) U !((((i9.i1.u118.p389==1)&&(i15.i1.u28.p81==1))&&(i13.i2.u11...545
=> equivalent forward existential formula: [((FwdU(Init,(!(!((E(!(!((((i9.i1.u118.p389==1)&&(i15.i1.u28.p81==1))&&(i13.i2.u115.p375==1)))) U (!(!(EX(!(!(((...959
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t6, t7, t8, t9, t154, t162, t178, t194, t202, t214, t226, t245, t254, t380, t382, t38...1246
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 446 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 446 transition count 391
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 439 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 439 transition count 384
Applied a total of 58 rules in 36 ms. Remains 439 /468 variables (removed 29) and now considering 384/413 (removed 29) transitions.
// Phase 1: matrix 384 rows 439 cols
[2025-05-30 03:21:53] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:21:53] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-05-30 03:21:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:21:56] [INFO ] Implicit Places using invariants and state equation in 2540 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2025-05-30 03:21:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:15] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:16] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:16] [INFO ] Deduced a trap composed of 52 places in 326 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:16] [INFO ] Deduced a trap composed of 52 places in 295 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:17] [INFO ] Deduced a trap composed of 52 places in 349 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:17] [INFO ] Deduced a trap composed of 52 places in 294 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:17] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:18] [INFO ] Deduced a trap composed of 49 places in 297 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:18] [INFO ] Deduced a trap composed of 52 places in 277 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:18] [INFO ] Deduced a trap composed of 52 places in 254 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:18] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:19] [INFO ] Deduced a trap composed of 52 places in 285 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:19] [INFO ] Deduced a trap composed of 52 places in 330 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:19] [INFO ] Deduced a trap composed of 52 places in 308 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:20] [INFO ] Deduced a trap composed of 70 places in 305 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:20] [INFO ] Deduced a trap composed of 70 places in 359 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:20] [INFO ] Deduced a trap composed of 70 places in 350 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:21] [INFO ] Deduced a trap composed of 70 places in 321 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:21] [INFO ] Deduced a trap composed of 52 places in 347 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:22] [INFO ] Deduced a trap composed of 52 places in 345 ms of which 61 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:23] [INFO ] Deduced a trap composed of 73 places in 325 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:23] [INFO ] Deduced a trap composed of 73 places in 348 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:23] [INFO ] Deduced a trap composed of 68 places in 334 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:24] [INFO ] Deduced a trap composed of 73 places in 350 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:24] [INFO ] Deduced a trap composed of 52 places in 346 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:25] [INFO ] Deduced a trap composed of 71 places in 340 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:25] [INFO ] Deduced a trap composed of 71 places in 334 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:25] [INFO ] Deduced a trap composed of 66 places in 350 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:26] [INFO ] Deduced a trap composed of 71 places in 362 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:22:26] [INFO ] Deduced a trap composed of 66 places in 350 ms of which 68 ms to minimize.
SMT process timed out in 30246ms, After SMT, problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 30248ms
Starting structural reductions in LTL mode, iteration 1 : 439/468 places, 384/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33194 ms. Remains : 439/468 places, 384/413 transitions.
[2025-05-30 03:22:26] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:22:26] [INFO ] Flatten gal took : 17 ms
[2025-05-30 03:22:26] [INFO ] Input system was already deterministic with 384 transitions.
[2025-05-30 03:22:26] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:22:26] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:22:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13201958889172637855.gal : 3 ms
[2025-05-30 03:22:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5048372991466435282.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13201958889172637855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5048372991466435282.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:22:56] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:22:56] [INFO ] Applying decomposition
[2025-05-30 03:22:56] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5096327524954614354.txt' '-o' '/tmp/graph5096327524954614354.bin' '-w' '/tmp/graph5096327524954614354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5096327524954614354.bin' '-l' '-1' '-v' '-w' '/tmp/graph5096327524954614354.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:22:56] [INFO ] Decomposing Gal with order
[2025-05-30 03:22:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:22:56] [INFO ] Removed a total of 247 redundant transitions.
[2025-05-30 03:22:56] [INFO ] Flatten gal took : 21 ms
[2025-05-30 03:22:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2025-05-30 03:22:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10026261294264687449.gal : 4 ms
[2025-05-30 03:22:56] [INFO ] Time to serialize properties into /tmp/CTLFireability101015190631817045.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10026261294264687449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability101015190631817045.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,0.816087,22748,3250,64,33622,723,1075,89401,69,1590,0
Converting to forward existential form...Done !
original formula: (EF(AG(EX((i10.i3.u106.p343==0)))) * AF(EX(EG((((i0.u10.p25==0)||(i11.i1.u92.p276==0))||(i12.i1.u119.p528==0))))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !(EX((i10.i3.u106.p343==0))))))))] = FALSE * [FwdG(Init,!(EX(EG((((i0.u10.p25==0...217
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t151, t159, t171, t179, t187, t195, t207, t215, t223, t249, t375, t377, t379,...1216
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 451 transition count 396
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 451 transition count 396
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 444 transition count 389
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 444 transition count 389
Applied a total of 48 rules in 29 ms. Remains 444 /468 variables (removed 24) and now considering 389/413 (removed 24) transitions.
// Phase 1: matrix 389 rows 444 cols
[2025-05-30 03:23:26] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:23:27] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-05-30 03:23:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:23:29] [INFO ] Implicit Places using invariants and state equation in 2112 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
Running 388 sub problems to find dead transitions.
[2025-05-30 03:23:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 1/444 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:51] [INFO ] Deduced a trap composed of 51 places in 344 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:51] [INFO ] Deduced a trap composed of 54 places in 306 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:51] [INFO ] Deduced a trap composed of 54 places in 275 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:52] [INFO ] Deduced a trap composed of 72 places in 343 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:52] [INFO ] Deduced a trap composed of 51 places in 309 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:52] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:53] [INFO ] Deduced a trap composed of 51 places in 308 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:53] [INFO ] Deduced a trap composed of 51 places in 325 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:53] [INFO ] Deduced a trap composed of 70 places in 319 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:54] [INFO ] Deduced a trap composed of 65 places in 309 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:54] [INFO ] Deduced a trap composed of 51 places in 330 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:54] [INFO ] Deduced a trap composed of 51 places in 326 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:55] [INFO ] Deduced a trap composed of 51 places in 312 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:55] [INFO ] Deduced a trap composed of 51 places in 321 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:55] [INFO ] Deduced a trap composed of 51 places in 338 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:56] [INFO ] Deduced a trap composed of 70 places in 313 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:56] [INFO ] Deduced a trap composed of 53 places in 334 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:57] [INFO ] Deduced a trap composed of 53 places in 337 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:57] [INFO ] Deduced a trap composed of 53 places in 322 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:57] [INFO ] Deduced a trap composed of 53 places in 324 ms of which 49 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:58] [INFO ] Deduced a trap composed of 72 places in 331 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:58] [INFO ] Deduced a trap composed of 72 places in 374 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:59] [INFO ] Deduced a trap composed of 72 places in 344 ms of which 76 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/833 variables, and 114 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 1/444 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:06] [INFO ] Deduced a trap composed of 72 places in 214 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:07] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:07] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:07] [INFO ] Deduced a trap composed of 72 places in 364 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:08] [INFO ] Deduced a trap composed of 72 places in 319 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:08] [INFO ] Deduced a trap composed of 67 places in 349 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:08] [INFO ] Deduced a trap composed of 67 places in 318 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:09] [INFO ] Deduced a trap composed of 65 places in 346 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:09] [INFO ] Deduced a trap composed of 72 places in 400 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:10] [INFO ] Deduced a trap composed of 72 places in 322 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:10] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:11] [INFO ] Deduced a trap composed of 47 places in 355 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:11] [INFO ] Deduced a trap composed of 65 places in 323 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:11] [INFO ] Deduced a trap composed of 65 places in 318 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:12] [INFO ] Deduced a trap composed of 65 places in 317 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:12] [INFO ] Deduced a trap composed of 65 places in 315 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:12] [INFO ] Deduced a trap composed of 65 places in 304 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:13] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:13] [INFO ] Deduced a trap composed of 72 places in 283 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:13] [INFO ] Deduced a trap composed of 72 places in 284 ms of which 65 ms to minimize.
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 20/134 constraints. Problems are: Problem set: 3 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:14] [INFO ] Deduced a trap composed of 75 places in 245 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:14] [INFO ] Deduced a trap composed of 75 places in 294 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:15] [INFO ] Deduced a trap composed of 74 places in 337 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:15] [INFO ] Deduced a trap composed of 74 places in 337 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:15] [INFO ] Deduced a trap composed of 74 places in 330 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:16] [INFO ] Deduced a trap composed of 74 places in 319 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:16] [INFO ] Deduced a trap composed of 74 places in 290 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:16] [INFO ] Deduced a trap composed of 74 places in 336 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:17] [INFO ] Deduced a trap composed of 74 places in 320 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:17] [INFO ] Deduced a trap composed of 74 places in 306 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:17] [INFO ] Deduced a trap composed of 74 places in 323 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:18] [INFO ] Deduced a trap composed of 74 places in 332 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:18] [INFO ] Deduced a trap composed of 74 places in 316 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:18] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:19] [INFO ] Deduced a trap composed of 74 places in 332 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:19] [INFO ] Deduced a trap composed of 74 places in 326 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:19] [INFO ] Deduced a trap composed of 74 places in 231 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:20] [INFO ] Deduced a trap composed of 74 places in 211 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:20] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:20] [INFO ] Deduced a trap composed of 75 places in 334 ms of which 66 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 20/154 constraints. Problems are: Problem set: 3 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:21] [INFO ] Deduced a trap composed of 75 places in 318 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:21] [INFO ] Deduced a trap composed of 75 places in 332 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:22] [INFO ] Deduced a trap composed of 75 places in 312 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:22] [INFO ] Deduced a trap composed of 75 places in 314 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:22] [INFO ] Deduced a trap composed of 75 places in 297 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:23] [INFO ] Deduced a trap composed of 75 places in 344 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:23] [INFO ] Deduced a trap composed of 75 places in 339 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:23] [INFO ] Deduced a trap composed of 75 places in 338 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:24] [INFO ] Deduced a trap composed of 75 places in 334 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:24] [INFO ] Deduced a trap composed of 75 places in 306 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:24] [INFO ] Deduced a trap composed of 75 places in 344 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:25] [INFO ] Deduced a trap composed of 75 places in 294 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:25] [INFO ] Deduced a trap composed of 70 places in 315 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:25] [INFO ] Deduced a trap composed of 70 places in 332 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:26] [INFO ] Deduced a trap composed of 70 places in 338 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:26] [INFO ] Deduced a trap composed of 70 places in 328 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:26] [INFO ] Deduced a trap composed of 70 places in 337 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:27] [INFO ] Deduced a trap composed of 70 places in 352 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:27] [INFO ] Deduced a trap composed of 70 places in 328 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:27] [INFO ] Deduced a trap composed of 70 places in 280 ms of which 58 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 20/174 constraints. Problems are: Problem set: 23 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:29] [INFO ] Deduced a trap composed of 26 places in 331 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:24:29] [INFO ] Deduced a trap composed of 53 places in 337 ms of which 56 ms to minimize.
SMT process timed out in 60086ms, After SMT, problems are : Problem set: 23 solved, 365 unsolved
Search for dead transitions found 23 dead transitions in 60088ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 444/468 places, 366/413 transitions.
Applied a total of 0 rules in 16 ms. Remains 444 /444 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62626 ms. Remains : 444/468 places, 366/413 transitions.
[2025-05-30 03:24:29] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:24:29] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:24:29] [INFO ] Input system was already deterministic with 366 transitions.
[2025-05-30 03:24:29] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:24:29] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:24:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15425266763158002016.gal : 3 ms
[2025-05-30 03:24:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13751993687674453133.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15425266763158002016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13751993687674453133.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:24:59] [INFO ] Flatten gal took : 13 ms
[2025-05-30 03:24:59] [INFO ] Applying decomposition
[2025-05-30 03:24:59] [INFO ] Flatten gal took : 8 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/graph18155347545731437503.txt' '-o' '/tmp/graph18155347545731437503.bin' '-w' '/tmp/graph18155347545731437503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18155347545731437503.bin' '-l' '-1' '-v' '-w' '/tmp/graph18155347545731437503.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:24:59] [INFO ] Decomposing Gal with order
[2025-05-30 03:24:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:24:59] [INFO ] Removed a total of 151 redundant transitions.
[2025-05-30 03:24:59] [INFO ] Flatten gal took : 19 ms
[2025-05-30 03:24:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 03:24:59] [INFO ] Time to serialize gal into /tmp/CTLFireability5618626950679018779.gal : 4 ms
[2025-05-30 03:24:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10596863477074398404.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5618626950679018779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10596863477074398404.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.72547e+22,1.52726,48620,4585,44,76393,469,1022,217613,55,1287,0
Converting to forward existential form...Done !
original formula: (EF((A((i6.i3.u149.p538!=1) U A((i4.i0.u12.p29==1) U (i11.u8.p19==1))) * AX(EG((i15.i0.u122.p411==1))))) * E(((A(AF((i6.i1.u127.p441==1))...386
=> equivalent forward existential formula: ([(((FwdU(FwdU((Init * E(TRUE U (!((E(!(!((E(!((i11.u8.p19==1)) U (!((i4.i0.u12.p29==1)) * !((i11.u8.p19==1)))) ...1632
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t9, t10, t155, t163, t175, t183, t195, t211, t219, t227, t245, t253, t357, t359, t361...1276
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 447 transition count 392
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 447 transition count 392
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 441 transition count 386
Applied a total of 54 rules in 29 ms. Remains 441 /468 variables (removed 27) and now considering 386/413 (removed 27) transitions.
// Phase 1: matrix 386 rows 441 cols
[2025-05-30 03:25:29] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:25:30] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-05-30 03:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:25:32] [INFO ] Implicit Places using invariants and state equation in 2291 ms returned []
Implicit Place search using SMT with State Equation took 2655 ms to find 0 implicit places.
Running 385 sub problems to find dead transitions.
[2025-05-30 03:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:54] [INFO ] Deduced a trap composed of 51 places in 347 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:55] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:55] [INFO ] Deduced a trap composed of 72 places in 378 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:56] [INFO ] Deduced a trap composed of 72 places in 377 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:56] [INFO ] Deduced a trap composed of 72 places in 431 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:56] [INFO ] Deduced a trap composed of 72 places in 413 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:57] [INFO ] Deduced a trap composed of 72 places in 349 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:57] [INFO ] Deduced a trap composed of 72 places in 318 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:58] [INFO ] Deduced a trap composed of 72 places in 366 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:58] [INFO ] Deduced a trap composed of 72 places in 357 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:58] [INFO ] Deduced a trap composed of 72 places in 363 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:59] [INFO ] Deduced a trap composed of 72 places in 349 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:59] [INFO ] Deduced a trap composed of 72 places in 350 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:25:59] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:00] [INFO ] Deduced a trap composed of 72 places in 413 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:00] [INFO ] Deduced a trap composed of 72 places in 348 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:01] [INFO ] Deduced a trap composed of 72 places in 343 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:01] [INFO ] Deduced a trap composed of 72 places in 356 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:01] [INFO ] Deduced a trap composed of 72 places in 321 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:02] [INFO ] Deduced a trap composed of 72 places in 326 ms of which 52 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/827 variables, and 111 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/441 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:09] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:09] [INFO ] Deduced a trap composed of 75 places in 307 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:10] [INFO ] Deduced a trap composed of 75 places in 295 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:10] [INFO ] Deduced a trap composed of 75 places in 322 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:10] [INFO ] Deduced a trap composed of 75 places in 321 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:11] [INFO ] Deduced a trap composed of 75 places in 312 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:11] [INFO ] Deduced a trap composed of 75 places in 332 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:11] [INFO ] Deduced a trap composed of 75 places in 325 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:12] [INFO ] Deduced a trap composed of 74 places in 333 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:12] [INFO ] Deduced a trap composed of 74 places in 315 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:12] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:13] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:13] [INFO ] Deduced a trap composed of 74 places in 336 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:13] [INFO ] Deduced a trap composed of 74 places in 324 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:14] [INFO ] Deduced a trap composed of 74 places in 325 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:14] [INFO ] Deduced a trap composed of 74 places in 327 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:14] [INFO ] Deduced a trap composed of 74 places in 323 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:15] [INFO ] Deduced a trap composed of 74 places in 305 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:15] [INFO ] Deduced a trap composed of 74 places in 330 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:15] [INFO ] Deduced a trap composed of 74 places in 330 ms of which 77 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 20/131 constraints. Problems are: Problem set: 8 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:16] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:16] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:17] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:17] [INFO ] Deduced a trap composed of 72 places in 223 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:17] [INFO ] Deduced a trap composed of 67 places in 386 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:18] [INFO ] Deduced a trap composed of 67 places in 349 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:18] [INFO ] Deduced a trap composed of 72 places in 366 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:18] [INFO ] Deduced a trap composed of 72 places in 330 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:19] [INFO ] Deduced a trap composed of 72 places in 356 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:19] [INFO ] Deduced a trap composed of 53 places in 333 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:19] [INFO ] Deduced a trap composed of 72 places in 309 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:20] [INFO ] Deduced a trap composed of 72 places in 282 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:20] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:20] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:20] [INFO ] Deduced a trap composed of 53 places in 327 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:21] [INFO ] Deduced a trap composed of 72 places in 451 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:21] [INFO ] Deduced a trap composed of 72 places in 342 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:22] [INFO ] Deduced a trap composed of 72 places in 366 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:22] [INFO ] Deduced a trap composed of 53 places in 345 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:22] [INFO ] Deduced a trap composed of 72 places in 395 ms of which 116 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/151 constraints. Problems are: Problem set: 8 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:23] [INFO ] Deduced a trap composed of 75 places in 337 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:24] [INFO ] Deduced a trap composed of 75 places in 333 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:24] [INFO ] Deduced a trap composed of 75 places in 346 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:24] [INFO ] Deduced a trap composed of 75 places in 334 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:25] [INFO ] Deduced a trap composed of 75 places in 331 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:25] [INFO ] Deduced a trap composed of 75 places in 360 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:25] [INFO ] Deduced a trap composed of 75 places in 332 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:26] [INFO ] Deduced a trap composed of 75 places in 327 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:26] [INFO ] Deduced a trap composed of 73 places in 339 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:27] [INFO ] Deduced a trap composed of 73 places in 366 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:27] [INFO ] Deduced a trap composed of 73 places in 328 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:27] [INFO ] Deduced a trap composed of 68 places in 343 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:28] [INFO ] Deduced a trap composed of 68 places in 331 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:28] [INFO ] Deduced a trap composed of 68 places in 334 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:29] [INFO ] Deduced a trap composed of 68 places in 313 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:29] [INFO ] Deduced a trap composed of 73 places in 349 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:29] [INFO ] Deduced a trap composed of 69 places in 347 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:30] [INFO ] Deduced a trap composed of 69 places in 341 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:30] [INFO ] Deduced a trap composed of 70 places in 344 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:31] [INFO ] Deduced a trap composed of 70 places in 338 ms of which 71 ms to minimize.
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/171 constraints. Problems are: Problem set: 24 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:32] [INFO ] Deduced a trap composed of 75 places in 338 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:32] [INFO ] Deduced a trap composed of 75 places in 355 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:32] [INFO ] Deduced a trap composed of 75 places in 350 ms of which 79 ms to minimize.
SMT process timed out in 60352ms, After SMT, problems are : Problem set: 24 solved, 361 unsolved
Search for dead transitions found 24 dead transitions in 60353ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 441/468 places, 362/413 transitions.
Applied a total of 0 rules in 17 ms. Remains 441 /441 variables (removed 0) and now considering 362/362 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63055 ms. Remains : 441/468 places, 362/413 transitions.
[2025-05-30 03:26:32] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:26:32] [INFO ] Flatten gal took : 13 ms
[2025-05-30 03:26:32] [INFO ] Input system was already deterministic with 362 transitions.
[2025-05-30 03:26:32] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:26:32] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:26:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5190643198651179264.gal : 2 ms
[2025-05-30 03:26:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7479471812912455076.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5190643198651179264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7479471812912455076.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:27:02] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:27:02] [INFO ] Applying decomposition
[2025-05-30 03:27:02] [INFO ] Flatten gal took : 8 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/graph3836463764566678623.txt' '-o' '/tmp/graph3836463764566678623.bin' '-w' '/tmp/graph3836463764566678623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3836463764566678623.bin' '-l' '-1' '-v' '-w' '/tmp/graph3836463764566678623.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:27:03] [INFO ] Decomposing Gal with order
[2025-05-30 03:27:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:27:03] [INFO ] Removed a total of 133 redundant transitions.
[2025-05-30 03:27:03] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:27:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-05-30 03:27:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13540989932339601762.gal : 4 ms
[2025-05-30 03:27:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11026592890274369518.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13540989932339601762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11026592890274369518.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.34007e+22,1.85254,36476,4631,48,50540,715,990,125615,65,1628,0
Converting to forward existential form...Done !
original formula: (EF((i0.i0.u70.p214==1)) * EX(AX(EG((i18.u118.p420==0)))))
=> equivalent forward existential formula: [(EY((Init * E(TRUE U (i0.i0.u70.p214==1)))) * !(EX(!(EG((i18.u118.p420==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t10, t156, t165, t173, t181, t197, t209, t225, t247, t251, t354, t355, i0.i0.u70....1207
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Graph (complete) has 1033 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 466 transition count 362
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 417 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 415 transition count 360
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 103 place count 415 transition count 259
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 323 place count 296 transition count 259
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 342 place count 277 transition count 240
Iterating global reduction 3 with 19 rules applied. Total rules applied 361 place count 277 transition count 240
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 361 place count 277 transition count 238
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 365 place count 275 transition count 238
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 572 place count 170 transition count 136
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 578 place count 170 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 579 place count 169 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 580 place count 168 transition count 135
Applied a total of 580 rules in 51 ms. Remains 168 /468 variables (removed 300) and now considering 135/413 (removed 278) transitions.
// Phase 1: matrix 135 rows 168 cols
[2025-05-30 03:27:33] [INFO ] Computed 69 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:27:33] [INFO ] Implicit Places using invariants in 207 ms returned [41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 208 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 159/468 places, 135/413 transitions.
Applied a total of 0 rules in 10 ms. Remains 159 /159 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 269 ms. Remains : 159/468 places, 135/413 transitions.
[2025-05-30 03:27:33] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:27:33] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:27:33] [INFO ] Input system was already deterministic with 135 transitions.
[2025-05-30 03:27:33] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:27:33] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:27:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17621943622711637879.gal : 2 ms
[2025-05-30 03:27:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9539241921796812219.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17621943622711637879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9539241921796812219.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,100572,0.34568,10792,2,4107,5,22991,6,0,769,20994,0
Converting to forward existential form...Done !
original formula: EF((EG((((p330==0)&&(((p148==0)||(p346==0))||(p528==0)))&&(((p403==0)||(p289==0))&&(p445==1)))) * (p462==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (p462==1)),(((p330==0)&&(((p148==0)||(p346==0))||(p528==0)))&&(((p403==0)||(p289==0))&&...177
(forward)formula 0,0,1.3194,36164,1,0,9,122415,19,3,4367,39198,6
FORMULA BusinessProcesses-PT-11-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 445 transition count 390
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 438 transition count 383
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 438 transition count 383
Applied a total of 60 rules in 33 ms. Remains 438 /468 variables (removed 30) and now considering 383/413 (removed 30) transitions.
// Phase 1: matrix 383 rows 438 cols
[2025-05-30 03:27:34] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:27:35] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-05-30 03:27:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:27:36] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2025-05-30 03:27:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:27:58] [INFO ] Deduced a trap composed of 49 places in 311 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:27:59] [INFO ] Deduced a trap composed of 52 places in 328 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:27:59] [INFO ] Deduced a trap composed of 52 places in 305 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:27:59] [INFO ] Deduced a trap composed of 52 places in 314 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:00] [INFO ] Deduced a trap composed of 52 places in 312 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:00] [INFO ] Deduced a trap composed of 52 places in 307 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:00] [INFO ] Deduced a trap composed of 52 places in 303 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:01] [INFO ] Deduced a trap composed of 52 places in 321 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:01] [INFO ] Deduced a trap composed of 52 places in 319 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:01] [INFO ] Deduced a trap composed of 52 places in 302 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:02] [INFO ] Deduced a trap composed of 70 places in 306 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:02] [INFO ] Deduced a trap composed of 70 places in 327 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:02] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:03] [INFO ] Deduced a trap composed of 70 places in 317 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:03] [INFO ] Deduced a trap composed of 73 places in 320 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:03] [INFO ] Deduced a trap composed of 73 places in 329 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:04] [INFO ] Deduced a trap composed of 73 places in 317 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:04] [INFO ] Deduced a trap composed of 73 places in 304 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:04] [INFO ] Deduced a trap composed of 73 places in 309 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:05] [INFO ] Deduced a trap composed of 73 places in 323 ms of which 66 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:06] [INFO ] Deduced a trap composed of 73 places in 299 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:06] [INFO ] Deduced a trap composed of 73 places in 317 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:06] [INFO ] Deduced a trap composed of 73 places in 356 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:28:07] [INFO ] Deduced a trap composed of 73 places in 306 ms of which 63 ms to minimize.
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 30164ms
Starting structural reductions in LTL mode, iteration 1 : 438/468 places, 383/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32379 ms. Remains : 438/468 places, 383/413 transitions.
[2025-05-30 03:28:07] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:28:07] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:28:07] [INFO ] Input system was already deterministic with 383 transitions.
[2025-05-30 03:28:07] [INFO ] Flatten gal took : 20 ms
[2025-05-30 03:28:07] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:28:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13693590213498112792.gal : 2 ms
[2025-05-30 03:28:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8258557274125591232.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13693590213498112792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8258557274125591232.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:28:37] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:28:37] [INFO ] Applying decomposition
[2025-05-30 03:28:37] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10732967226899642813.txt' '-o' '/tmp/graph10732967226899642813.bin' '-w' '/tmp/graph10732967226899642813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10732967226899642813.bin' '-l' '-1' '-v' '-w' '/tmp/graph10732967226899642813.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:28:37] [INFO ] Decomposing Gal with order
[2025-05-30 03:28:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:28:37] [INFO ] Removed a total of 252 redundant transitions.
[2025-05-30 03:28:37] [INFO ] Flatten gal took : 20 ms
[2025-05-30 03:28:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 03:28:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14036859379603981530.gal : 5 ms
[2025-05-30 03:28:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3897185702453823327.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14036859379603981530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3897185702453823327.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,0.962275,26780,3012,66,43818,1581,1000,93212,61,3970,0
Converting to forward existential form...Done !
original formula: (AX((i4.i1.u48.p141==1)) + EF(EG((i11.u64.p185==1))))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U EG((i11.u64.p185==1)))))) * !((i4.i1.u48.p141==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t150, t158, t174, t178, t194, t206, t214, t222, t248, t374, t375, t376, t378,...1170
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,4.80821,131228,1,0,268233,1581,6182,531530,303,3970,549725
FORMULA BusinessProcesses-PT-11-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 445 transition count 390
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 438 transition count 383
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 438 transition count 383
Applied a total of 60 rules in 27 ms. Remains 438 /468 variables (removed 30) and now considering 383/413 (removed 30) transitions.
[2025-05-30 03:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:28:42] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-05-30 03:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:28:44] [INFO ] Implicit Places using invariants and state equation in 2040 ms returned []
Implicit Place search using SMT with State Equation took 2440 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2025-05-30 03:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:06] [INFO ] Deduced a trap composed of 49 places in 326 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:06] [INFO ] Deduced a trap composed of 52 places in 313 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:07] [INFO ] Deduced a trap composed of 52 places in 300 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:07] [INFO ] Deduced a trap composed of 52 places in 299 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:07] [INFO ] Deduced a trap composed of 52 places in 301 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:08] [INFO ] Deduced a trap composed of 52 places in 315 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:08] [INFO ] Deduced a trap composed of 52 places in 319 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:08] [INFO ] Deduced a trap composed of 52 places in 308 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:09] [INFO ] Deduced a trap composed of 52 places in 290 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:09] [INFO ] Deduced a trap composed of 52 places in 310 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:09] [INFO ] Deduced a trap composed of 70 places in 341 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:10] [INFO ] Deduced a trap composed of 70 places in 326 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:10] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:10] [INFO ] Deduced a trap composed of 70 places in 311 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:11] [INFO ] Deduced a trap composed of 73 places in 308 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:11] [INFO ] Deduced a trap composed of 73 places in 338 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:11] [INFO ] Deduced a trap composed of 73 places in 325 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:12] [INFO ] Deduced a trap composed of 73 places in 320 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:12] [INFO ] Deduced a trap composed of 73 places in 322 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:12] [INFO ] Deduced a trap composed of 73 places in 314 ms of which 63 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:13] [INFO ] Deduced a trap composed of 73 places in 324 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:14] [INFO ] Deduced a trap composed of 73 places in 310 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:14] [INFO ] Deduced a trap composed of 73 places in 355 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:29:14] [INFO ] Deduced a trap composed of 73 places in 332 ms of which 66 ms to minimize.
SMT process timed out in 30092ms, After SMT, problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 30093ms
Starting structural reductions in LTL mode, iteration 1 : 438/468 places, 383/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32562 ms. Remains : 438/468 places, 383/413 transitions.
[2025-05-30 03:29:14] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:29:14] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:29:14] [INFO ] Input system was already deterministic with 383 transitions.
[2025-05-30 03:29:14] [INFO ] Flatten gal took : 15 ms
[2025-05-30 03:29:14] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:29:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5908243500668662676.gal : 3 ms
[2025-05-30 03:29:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5369322907759818367.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5908243500668662676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5369322907759818367.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:29:44] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:29:44] [INFO ] Applying decomposition
[2025-05-30 03:29:44] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16747811815912834892.txt' '-o' '/tmp/graph16747811815912834892.bin' '-w' '/tmp/graph16747811815912834892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16747811815912834892.bin' '-l' '-1' '-v' '-w' '/tmp/graph16747811815912834892.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:29:44] [INFO ] Decomposing Gal with order
[2025-05-30 03:29:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:29:45] [INFO ] Removed a total of 250 redundant transitions.
[2025-05-30 03:29:45] [INFO ] Flatten gal took : 19 ms
[2025-05-30 03:29:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 03:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15702293296193005457.gal : 4 ms
[2025-05-30 03:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16530202863064429494.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15702293296193005457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16530202863064429494.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,1.13479,28804,3785,60,45857,595,1049,115870,64,1582,0
Converting to forward existential form...Done !
original formula: AG((!(E((i3.u12.p30==1) U (i8.i0.u57.p173==1))) + AX(FALSE)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!(E((i3.u12.p30==1) U (i8.i0.u57.p173==1)))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t150, t154, t162, t170, t178, t190, t198, t206, t210, t218, t222, t248, t374,...1178
(forward)formula 0,0,4.89671,140548,1,0,254737,595,6881,596246,275,1598,769578
FORMULA BusinessProcesses-PT-11-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
[2025-05-30 03:29:49] [INFO ] Flatten gal took : 11 ms
[2025-05-30 03:29:50] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:29:50] [INFO ] Applying decomposition
[2025-05-30 03:29:50] [INFO ] Flatten gal took : 10 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/graph6713710538029718786.txt' '-o' '/tmp/graph6713710538029718786.bin' '-w' '/tmp/graph6713710538029718786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6713710538029718786.bin' '-l' '-1' '-v' '-w' '/tmp/graph6713710538029718786.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:29:50] [INFO ] Decomposing Gal with order
[2025-05-30 03:29:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:29:50] [INFO ] Removed a total of 253 redundant transitions.
[2025-05-30 03:29:50] [INFO ] Flatten gal took : 20 ms
[2025-05-30 03:29:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 03:29:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8119038213304091998.gal : 5 ms
[2025-05-30 03:29:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15159801144868672020.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8119038213304091998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15159801144868672020.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.30021e+22,3.6694,84248,4727,62,116147,860,1161,530793,63,3016,0
Converting to forward existential form...Done !
original formula: (EG(!(E(!(EG((i10.i0.u129.p513==1))) U ((i11.u34.p67==1) * EF((i10.i0.u167.p547==1)))))) * EX((((i0.u45.p130==0) + AX(EX((((i14.i0.u66.p1...236
=> equivalent forward existential formula: (([(EY((Init * EG(!(E(!(EG((i10.i0.u129.p513==1))) U ((i11.u34.p67==1) * E(TRUE U (i10.i0.u167.p547==1)))))))) *...544
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t6, t8, t9, t176, t180, t189, t197, t205, t217, t225, t237, t245, t249, t268, t26...1480
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
ITS-tools command line returned an error code 139
[2025-05-30 03:40:02] [INFO ] Applying decomposition
[2025-05-30 03:40:02] [INFO ] Flatten gal took : 11 ms
[2025-05-30 03:40:02] [INFO ] Decomposing Gal with order
[2025-05-30 03:40:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:40:02] [INFO ] Removed a total of 132 redundant transitions.
[2025-05-30 03:40:02] [INFO ] Flatten gal took : 22 ms
[2025-05-30 03:40:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 75 ms.
[2025-05-30 03:40:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6043607258312894751.gal : 7 ms
[2025-05-30 03:40:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16050504210729472362.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6043607258312894751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16050504210729472362.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.30021e+22,530.766,10799640,111184,1891,3.64643e+06,14008,1626,1.39266e+08,454,42945,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 04:07:19] [INFO ] Flatten gal took : 902 ms
[2025-05-30 04:07:20] [INFO ] Input system was already deterministic with 413 transitions.
[2025-05-30 04:07:21] [INFO ] Transformed 468 places.
[2025-05-30 04:07:21] [INFO ] Transformed 413 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 04:07:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3835817472474063645.gal : 15 ms
[2025-05-30 04:07:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3893614833323835964.ctl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3835817472474063645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3893614833323835964.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="BusinessProcesses-PT-11"
export BK_EXAMINATION="CTLFireability"
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 BusinessProcesses-PT-11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813300082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;