fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r156-tall-174881253700289
Last Updated
June 24, 2025

About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T06

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 ?FF?F???FFT?TFF? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700289.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 PolyORBLF-COL-S02J06T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K 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.5K 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 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T06-CTLCardinality-2025-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748912696980

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-06-03 01:04:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 01:04:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 01:04:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 01:04:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 01:04:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 623 ms
[2025-06-03 01:04:59] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2025-06-03 01:04:59] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-03 01:04:59] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (17 resets) in 1785 ms. (22 steps per ms) remains 54/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 106 ms. (37 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (10 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 32 ms. (121 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 52 ms. (75 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (9 resets) in 48 ms. (81 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 66 ms. (59 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 108 ms. (36 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 22 ms. (173 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (9 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
[2025-06-03 01:05:00] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 01:05:00] [INFO ] Computed 26 invariants in 15 ms
[2025-06-03 01:05:00] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 48 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/7 constraints. Problems are: Problem set: 9 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 45 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 3 (OVERLAPS) 16/77 variables, 8/15 constraints. Problems are: Problem set: 33 solved, 21 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 6/21 constraints. Problems are: Problem set: 44 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 44 solved, 10 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 6 (OVERLAPS) 4/81 variables, 5/26 constraints. Problems are: Problem set: 49 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 49 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 49 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 49 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 49 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 49 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 49 solved, 5 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 49 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 49 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 34/53 variables, 6/6 constraints. Problems are: Problem set: 49 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 49 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/58 variables, 4/10 constraints. Problems are: Problem set: 49 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 49 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 5 (OVERLAPS) 21/79 variables, 15/25 constraints. Problems are: Problem set: 51 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:01] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/26 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 3/116 constraints. Problems are: Problem set: 51 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:02] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 1/117 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/117 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/145 variables, 2/119 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 1/120 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 0/120 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/145 variables, 0/120 constraints. Problems are: Problem set: 51 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 120 constraints, problems are : Problem set: 51 solved, 3 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/54 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1590ms problems are : Problem set: 51 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 8 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 72 transition count 55
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 21 place count 70 transition count 55
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 31 place count 65 transition count 50
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 65 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 63 transition count 48
Applied a total of 35 rules in 31 ms. Remains 63 /81 variables (removed 18) and now considering 48/65 (removed 17) transitions.
Running 47 sub problems to find dead transitions.
[2025-06-03 01:05:02] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)
// Phase 1: matrix 47 rows 63 cols
[2025-06-03 01:05:02] [INFO ] Computed 25 invariants in 3 ms
[2025-06-03 01:05:02] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:02] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:02] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:02] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:02] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:02] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:02] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:03] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:03] [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-06-03 01:05:03] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:03] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 47/110 variables, 63/98 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 0/110 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 106 constraints, problems are : Problem set: 2 solved, 45 unsolved in 1797 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 9/33 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:04] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 2/37 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 1/38 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 47/110 variables, 63/101 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 8/109 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 45/154 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/110 variables, 1/155 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/110 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:07] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/110 variables, 1/156 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:08] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/110 variables, 2/158 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/110 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 18 (OVERLAPS) 0/110 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 158 constraints, problems are : Problem set: 2 solved, 45 unsolved in 5828 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/47 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7645ms problems are : Problem set: 2 solved, 45 unsolved
Search for dead transitions found 2 dead transitions in 7647ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/81 places, 46/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 44
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 60 transition count 42
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 3 rules in 7 ms. Remains 60 /63 variables (removed 3) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7696 ms. Remains : 60/81 places, 42/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (46 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (14 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Probably explored full state space saw : 17862 states, properties seen :0
Probabilistic random walk after 47169 steps, saw 17862 distinct states, run finished after 105 ms. (steps per millisecond=449 ) properties seen :0
Explored full state space saw : 17862 states, properties seen :0
Exhaustive walk after 47169 steps, saw 17862 distinct states, run finished after 61 ms. (steps per millisecond=773 ) properties seen :0
Successfully simplified 54 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 01:05:10] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2025-06-03 01:05:10] [INFO ] Flatten gal took : 28 ms
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 01:05:10] [INFO ] Flatten gal took : 9 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 01:05:10] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 31 ms.
[2025-06-03 01:05:10] [INFO ] Unfolded 7 HLPN properties in 2 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 289 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Applied a total of 0 rules in 20 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2025-06-03 01:05:10] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2025-06-03 01:05:10] [INFO ] Computed 50 invariants in 44 ms
[2025-06-03 01:05:10] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:21] [INFO ] Deduced a trap composed of 245 places in 271 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:21] [INFO ] Deduced a trap composed of 133 places in 240 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:22] [INFO ] Deduced a trap composed of 278 places in 288 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:22] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:22] [INFO ] Deduced a trap composed of 252 places in 327 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:23] [INFO ] Deduced a trap composed of 251 places in 317 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:23] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:23] [INFO ] Deduced a trap composed of 233 places in 291 ms of which 90 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 59 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:50] [INFO ] Deduced a trap composed of 247 places in 263 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:51] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 61 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40805ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40810ms
[2025-06-03 01:05:51] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 01:05:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:51] [INFO ] Implicit Places using invariants in 433 ms returned []
[2025-06-03 01:05:51] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 01:05:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:05:56] [INFO ] Implicit Places using invariants and state equation in 4206 ms returned []
Implicit Place search using SMT with State Equation took 4647 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2025-06-03 01:05:56] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 01:05:56] [INFO ] Invariant cache hit.
[2025-06-03 01:05:56] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:05] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:05] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:05] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:05] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:05] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:06] [INFO ] Deduced a trap composed of 245 places in 253 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:06] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:07] [INFO ] Deduced a trap composed of 251 places in 283 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:07] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:07] [INFO ] Deduced a trap composed of 233 places in 259 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:08] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:16] [INFO ] Deduced a trap composed of 247 places in 283 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:17] [INFO ] Deduced a trap composed of 260 places in 267 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:17] [INFO ] Deduced a trap composed of 260 places in 259 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:17] [INFO ] Deduced a trap composed of 259 places in 263 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:20] [INFO ] Deduced a trap composed of 224 places in 278 ms of which 62 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:22] [INFO ] Deduced a trap composed of 98 places in 229 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [INFO ] Deduced a trap composed of 133 places in 240 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [INFO ] Deduced a trap composed of 278 places in 277 ms of which 70 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 65 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:35] [INFO ] Deduced a trap composed of 253 places in 282 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:36] [INFO ] Deduced a trap composed of 349 places in 283 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:40] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:46] [INFO ] Deduced a trap composed of 278 places in 274 ms of which 71 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 69 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60505ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Finished structural reductions in LTL mode , in 1 iterations and 106003 ms. Remains : 536/536 places, 968/968 transitions.
Support contains 289 out of 536 places after structural reductions.
[2025-06-03 01:06:56] [INFO ] Flatten gal took : 80 ms
[2025-06-03 01:06:56] [INFO ] Flatten gal took : 67 ms
[2025-06-03 01:06:56] [INFO ] Input system was already deterministic with 968 transitions.
Support contains 271 out of 536 places (down from 289) after GAL structural reductions.
RANDOM walk for 40000 steps (11 resets) in 1559 ms. (25 steps per ms) remains 13/28 properties
BEST_FIRST walk for 40001 steps (8 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (9 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (10 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 139 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (40 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (10 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (15 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (10 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
[2025-06-03 01:06:57] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 01:06:57] [INFO ] Invariant cache hit.
[2025-06-03 01:06:57] [INFO ] State equation strengthened by 72 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 300/450 variables, 8/8 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 1/9 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 22/472 variables, 9/18 constraints. Problems are: Problem set: 7 solved, 6 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 9/27 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/27 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/536 variables, 23/50 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/50 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 956/1492 variables, 536/586 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1492 variables, 72/658 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1492/1492 variables, and 658 constraints, problems are : Problem set: 11 solved, 2 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 13/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 327/435 variables, 5/5 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/5 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/458 variables, 10/15 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 1/16 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/16 constraints. Problems are: Problem set: 11 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 6 (OVERLAPS) 75/533 variables, 32/48 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:59] [INFO ] Deduced a trap composed of 67 places in 291 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:59] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:59] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:59] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 4/52 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 0/52 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/534 variables, 1/53 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 0/53 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 956/1490 variables, 534/587 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1490/1492 variables, and 659 constraints, problems are : Problem set: 12 solved, 1 unsolved in 2167 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 534/536 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/12 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3145ms problems are : Problem set: 12 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 98 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 534 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 486 transition count 920
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 98 place count 486 transition count 902
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 134 place count 468 transition count 902
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 218 place count 426 transition count 860
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 426 transition count 848
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 242 place count 414 transition count 848
Applied a total of 242 rules in 132 ms. Remains 414 /536 variables (removed 122) and now considering 848/968 (removed 120) transitions.
Running 846 sub problems to find dead transitions.
[2025-06-03 01:07:01] [INFO ] Flow matrix only has 836 transitions (discarded 12 similar events)
// Phase 1: matrix 836 rows 414 cols
[2025-06-03 01:07:01] [INFO ] Computed 48 invariants in 17 ms
[2025-06-03 01:07:01] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:09] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:09] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:09] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:09] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:09] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:09] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:10] [INFO ] Deduced a trap composed of 167 places in 236 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:10] [INFO ] Deduced a trap composed of 155 places in 244 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:10] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:10] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:11] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:11] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:11] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:11] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:14] [INFO ] Deduced a trap composed of 247 places in 225 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:16] [INFO ] Deduced a trap composed of 176 places in 219 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:17] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:17] [INFO ] Deduced a trap composed of 176 places in 225 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:17] [INFO ] Deduced a trap composed of 176 places in 221 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:17] [INFO ] Deduced a trap composed of 176 places in 226 ms of which 60 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:20] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1250 variables, and 67 constraints, problems are : Problem set: 0 solved, 846 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/414 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1250 variables, and 67 constraints, problems are : Problem set: 0 solved, 846 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/414 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/846 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40538ms problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 40540ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40674 ms. Remains : 414/536 places, 848/968 transitions.
RANDOM walk for 40000 steps (18 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (16 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 343751 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 343751 steps, saw 189377 distinct states, run finished after 3004 ms. (steps per millisecond=114 ) properties seen :0
[2025-06-03 01:07:44] [INFO ] Flow matrix only has 836 transitions (discarded 12 similar events)
[2025-06-03 01:07:44] [INFO ] Invariant cache hit.
[2025-06-03 01:07:44] [INFO ] State equation strengthened by 72 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/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/184 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/205 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/217 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 178/395 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/398 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/411 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/412 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 836/1248 variables, 412/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1248 variables, 72/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1248 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1250 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1250 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1250 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1250 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1250/1250 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 414/414 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/184 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/205 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/217 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 178/395 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:46] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:46] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:46] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:46] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:46] [INFO ] Deduced a trap composed of 169 places in 202 ms of which 49 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/398 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/411 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/412 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 836/1248 variables, 412/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1248 variables, 72/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1248 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1250 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1250 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:48] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:48] [INFO ] Deduced a trap composed of 155 places in 245 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:48] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 63 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1250 variables, 3/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1250 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1250 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1250/1250 variables, and 542 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3172 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 414/414 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4014ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 98 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 848/848 transitions.
Applied a total of 0 rules in 19 ms. Remains 414 /414 variables (removed 0) and now considering 848/848 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 414/414 places, 848/848 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 848/848 transitions.
Applied a total of 0 rules in 19 ms. Remains 414 /414 variables (removed 0) and now considering 848/848 (removed 0) transitions.
[2025-06-03 01:07:49] [INFO ] Flow matrix only has 836 transitions (discarded 12 similar events)
[2025-06-03 01:07:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:07:50] [INFO ] Implicit Places using invariants in 1072 ms returned [330, 331, 332, 333, 334, 335]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1077 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 408/414 places, 848/848 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 402 transition count 842
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 402 transition count 842
Applied a total of 12 rules in 30 ms. Remains 402 /408 variables (removed 6) and now considering 842/848 (removed 6) transitions.
[2025-06-03 01:07:50] [INFO ] Flow matrix only has 830 transitions (discarded 12 similar events)
// Phase 1: matrix 830 rows 402 cols
[2025-06-03 01:07:50] [INFO ] Computed 42 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:07:51] [INFO ] Implicit Places using invariants in 1114 ms returned []
[2025-06-03 01:07:51] [INFO ] Flow matrix only has 830 transitions (discarded 12 similar events)
[2025-06-03 01:07:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:07:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:07:56] [INFO ] Implicit Places using invariants and state equation in 4816 ms returned []
Implicit Place search using SMT with State Equation took 5932 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 402/414 places, 842/848 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7058 ms. Remains : 402/414 places, 842/848 transitions.
RANDOM walk for 40000 steps (23 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (13 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 346788 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 346788 steps, saw 168743 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2025-06-03 01:07:59] [INFO ] Flow matrix only has 830 transitions (discarded 12 similar events)
[2025-06-03 01:07:59] [INFO ] Invariant cache hit.
[2025-06-03 01:07:59] [INFO ] State equation strengthened by 72 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/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 275/374 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/384 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/400 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 830/1230 variables, 400/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1230 variables, 72/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1230 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1232 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1232 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1232 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1232 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 402/402 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 275/374 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/384 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/400 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:59] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:59] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:00] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:00] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 830/1230 variables, 400/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1230 variables, 72/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1230 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1232 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1232 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:01] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 19 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1232 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1232 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1232 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1965 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 402/402 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2445ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 98 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 842/842 transitions.
Applied a total of 0 rules in 19 ms. Remains 402 /402 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 402/402 places, 842/842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 842/842 transitions.
Applied a total of 0 rules in 18 ms. Remains 402 /402 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2025-06-03 01:08:01] [INFO ] Flow matrix only has 830 transitions (discarded 12 similar events)
[2025-06-03 01:08:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:08:02] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2025-06-03 01:08:02] [INFO ] Flow matrix only has 830 transitions (discarded 12 similar events)
[2025-06-03 01:08:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:08:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:08:07] [INFO ] Implicit Places using invariants and state equation in 4816 ms returned []
Implicit Place search using SMT with State Equation took 5925 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:08:07] [INFO ] Redundant transitions in 47 ms returned []
Running 840 sub problems to find dead transitions.
[2025-06-03 01:08:07] [INFO ] Flow matrix only has 830 transitions (discarded 12 similar events)
[2025-06-03 01:08:07] [INFO ] Invariant cache hit.
[2025-06-03 01:08:07] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:14] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:14] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:14] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:15] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:15] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:15] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:15] [INFO ] Deduced a trap composed of 161 places in 232 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:15] [INFO ] Deduced a trap composed of 167 places in 216 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:16] [INFO ] Deduced a trap composed of 155 places in 221 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:16] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:16] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:16] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:19] [INFO ] Deduced a trap composed of 247 places in 233 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:24] [INFO ] Deduced a trap composed of 146 places in 212 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:25] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:29] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1232 variables, and 56 constraints, problems are : Problem set: 0 solved, 840 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/402 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 840/840 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 840 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:57] [INFO ] Deduced a trap composed of 157 places in 223 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:57] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:00] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1232 variables, and 59 constraints, problems are : Problem set: 0 solved, 840 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/402 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/840 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 840 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66567 ms. Remains : 402/402 places, 842/842 transitions.
Successfully simplified 12 atomic propositions for a total of 7 simplifications.
[2025-06-03 01:09:08] [INFO ] Flatten gal took : 48 ms
[2025-06-03 01:09:08] [INFO ] Flatten gal took : 46 ms
[2025-06-03 01:09:08] [INFO ] Input system was already deterministic with 968 transitions.
Support contains 185 out of 536 places (down from 245) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 534 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 480 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 480 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 420 transition count 854
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 312 place count 378 transition count 812
Applied a total of 312 rules in 51 ms. Remains 378 /536 variables (removed 158) and now considering 812/968 (removed 156) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 01:09:08] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 378 cols
[2025-06-03 01:09:08] [INFO ] Computed 48 invariants in 13 ms
[2025-06-03 01:09:08] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:15] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:15] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:15] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:15] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:15] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:15] [INFO ] Deduced a trap composed of 125 places in 228 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:15] [INFO ] Deduced a trap composed of 130 places in 214 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:16] [INFO ] Deduced a trap composed of 119 places in 222 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:16] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:16] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:17] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:18] [INFO ] Deduced a trap composed of 222 places in 182 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:23] [INFO ] Deduced a trap composed of 92 places in 189 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:24] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/1178 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:40] [INFO ] Deduced a trap composed of 126 places in 186 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:41] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:41] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/1178 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40422ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40424ms
[2025-06-03 01:09:48] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 01:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:09:49] [INFO ] Implicit Places using invariants in 1039 ms returned [342, 343, 344, 345, 346, 347]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1041 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 372/536 places, 812/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 366 transition count 806
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 366 transition count 806
Applied a total of 12 rules in 20 ms. Remains 366 /372 variables (removed 6) and now considering 806/812 (removed 6) transitions.
[2025-06-03 01:09:49] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 366 cols
[2025-06-03 01:09:50] [INFO ] Computed 42 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:09:51] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2025-06-03 01:09:51] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:09:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:09:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:09:58] [INFO ] Implicit Places using invariants and state equation in 7345 ms returned []
Implicit Place search using SMT with State Equation took 8526 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 366/536 places, 806/968 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 50064 ms. Remains : 366/536 places, 806/968 transitions.
[2025-06-03 01:09:58] [INFO ] Flatten gal took : 38 ms
[2025-06-03 01:09:58] [INFO ] Flatten gal took : 36 ms
[2025-06-03 01:09:58] [INFO ] Input system was already deterministic with 806 transitions.
[2025-06-03 01:09:58] [INFO ] Flatten gal took : 31 ms
[2025-06-03 01:09:58] [INFO ] Flatten gal took : 32 ms
[2025-06-03 01:09:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1229917140644247947.gal : 23 ms
[2025-06-03 01:09:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality12774730624838509832.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1229917140644247947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12774730624838509832.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:10:28] [INFO ] Flatten gal took : 30 ms
[2025-06-03 01:10:28] [INFO ] Applying decomposition
[2025-06-03 01:10:28] [INFO ] Flatten gal took : 29 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/graph9416976427404599092.txt' '-o' '/tmp/graph9416976427404599092.bin' '-w' '/tmp/graph9416976427404599092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9416976427404599092.bin' '-l' '-1' '-v' '-w' '/tmp/graph9416976427404599092.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:10:29] [INFO ] Decomposing Gal with order
[2025-06-03 01:10:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:10:29] [INFO ] Removed a total of 475 redundant transitions.
[2025-06-03 01:10:29] [INFO ] Flatten gal took : 198 ms
[2025-06-03 01:10:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 449 labels/synchronizations in 28 ms.
[2025-06-03 01:10:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality4936596307584389785.gal : 11 ms
[2025-06-03 01:10:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality9527224184514927653.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/CTLCardinality4936596307584389785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9527224184514927653.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 18 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:10:59] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2025-06-03 01:10:59] [INFO ] Computed 48 invariants in 15 ms
[2025-06-03 01:10:59] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:09] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:09] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:09] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:09] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:09] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:09] [INFO ] Deduced a trap composed of 245 places in 285 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:10] [INFO ] Deduced a trap composed of 86 places in 226 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:10] [INFO ] Deduced a trap composed of 121 places in 215 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:10] [INFO ] Deduced a trap composed of 266 places in 273 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:11] [INFO ] Deduced a trap composed of 266 places in 279 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:11] [INFO ] Deduced a trap composed of 266 places in 274 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:12] [INFO ] Deduced a trap composed of 250 places in 293 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:12] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:28] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:36] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40437ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40440ms
[2025-06-03 01:11:40] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:11:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:11:40] [INFO ] Implicit Places using invariants in 654 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 655 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41121 ms. Remains : 516/536 places, 956/968 transitions.
[2025-06-03 01:11:40] [INFO ] Flatten gal took : 46 ms
[2025-06-03 01:11:40] [INFO ] Flatten gal took : 46 ms
[2025-06-03 01:11:40] [INFO ] Input system was already deterministic with 956 transitions.
[2025-06-03 01:11:40] [INFO ] Flatten gal took : 43 ms
[2025-06-03 01:11:41] [INFO ] Flatten gal took : 43 ms
[2025-06-03 01:11:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality6803747610507726831.gal : 5 ms
[2025-06-03 01:11:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality7217454038697652927.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/CTLCardinality6803747610507726831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7217454038697652927.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:12:11] [INFO ] Flatten gal took : 36 ms
[2025-06-03 01:12:11] [INFO ] Applying decomposition
[2025-06-03 01:12:11] [INFO ] Flatten gal took : 32 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/graph2440059850322562798.txt' '-o' '/tmp/graph2440059850322562798.bin' '-w' '/tmp/graph2440059850322562798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2440059850322562798.bin' '-l' '-1' '-v' '-w' '/tmp/graph2440059850322562798.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:12:11] [INFO ] Decomposing Gal with order
[2025-06-03 01:12:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:12:11] [INFO ] Removed a total of 834 redundant transitions.
[2025-06-03 01:12:11] [INFO ] Flatten gal took : 82 ms
[2025-06-03 01:12:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 21 ms.
[2025-06-03 01:12:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality10297358311792721306.gal : 12 ms
[2025-06-03 01:12:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality17430754538969032991.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/CTLCardinality10297358311792721306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17430754538969032991.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 18 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:12:41] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:12:41] [INFO ] Invariant cache hit.
[2025-06-03 01:12:41] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:50] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:50] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:51] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:51] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:51] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:51] [INFO ] Deduced a trap composed of 245 places in 264 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:51] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:52] [INFO ] Deduced a trap composed of 250 places in 303 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:53] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:53] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:53] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 57 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:04] [INFO ] Deduced a trap composed of 212 places in 245 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:10] [INFO ] Deduced a trap composed of 241 places in 288 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:11] [INFO ] Deduced a trap composed of 348 places in 288 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:19] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 52 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40459ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40461ms
[2025-06-03 01:13:22] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:13:22] [INFO ] Implicit Places using invariants in 729 ms returned []
[2025-06-03 01:13:22] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:13:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:13:28] [INFO ] Implicit Places using invariants and state equation in 6130 ms returned []
Implicit Place search using SMT with State Equation took 6859 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:13:29] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:13:29] [INFO ] Invariant cache hit.
[2025-06-03 01:13:29] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:38] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:38] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:38] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:38] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:38] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:39] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:39] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:40] [INFO ] Deduced a trap composed of 250 places in 311 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:40] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:40] [INFO ] Deduced a trap composed of 233 places in 270 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:41] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:53] [INFO ] Deduced a trap composed of 212 places in 240 ms of which 59 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60481ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Starting structural reductions in LTL mode, iteration 1 : 522/536 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107829 ms. Remains : 522/536 places, 956/968 transitions.
[2025-06-03 01:14:29] [INFO ] Flatten gal took : 30 ms
[2025-06-03 01:14:29] [INFO ] Flatten gal took : 29 ms
[2025-06-03 01:14:29] [INFO ] Input system was already deterministic with 956 transitions.
[2025-06-03 01:14:29] [INFO ] Flatten gal took : 29 ms
[2025-06-03 01:14:29] [INFO ] Flatten gal took : 29 ms
[2025-06-03 01:14:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality17833531444756517922.gal : 6 ms
[2025-06-03 01:14:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality15004570045891107494.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/CTLCardinality17833531444756517922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15004570045891107494.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:14:59] [INFO ] Flatten gal took : 30 ms
[2025-06-03 01:14:59] [INFO ] Applying decomposition
[2025-06-03 01:14:59] [INFO ] Flatten gal took : 28 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/graph1494395497694948399.txt' '-o' '/tmp/graph1494395497694948399.bin' '-w' '/tmp/graph1494395497694948399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1494395497694948399.bin' '-l' '-1' '-v' '-w' '/tmp/graph1494395497694948399.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:14:59] [INFO ] Decomposing Gal with order
[2025-06-03 01:14:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:15:00] [INFO ] Removed a total of 791 redundant transitions.
[2025-06-03 01:15:00] [INFO ] Flatten gal took : 79 ms
[2025-06-03 01:15:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 29 ms.
[2025-06-03 01:15:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality12513775892420957848.gal : 7 ms
[2025-06-03 01:15:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14306955498427595482.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/CTLCardinality12513775892420957848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14306955498427595482.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 20 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:15:30] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:15:30] [INFO ] Invariant cache hit.
[2025-06-03 01:15:30] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:39] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:39] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:39] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:39] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:39] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:40] [INFO ] Deduced a trap composed of 245 places in 271 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:40] [INFO ] Deduced a trap composed of 121 places in 225 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:41] [INFO ] Deduced a trap composed of 250 places in 300 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:41] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:42] [INFO ] Deduced a trap composed of 233 places in 278 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:42] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 57 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:53] [INFO ] Deduced a trap composed of 212 places in 247 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:59] [INFO ] Deduced a trap composed of 241 places in 317 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:00] [INFO ] Deduced a trap composed of 348 places in 311 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:08] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40481ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40483ms
[2025-06-03 01:16:10] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:16:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:16:11] [INFO ] Implicit Places using invariants in 683 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 685 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41197 ms. Remains : 516/536 places, 956/968 transitions.
[2025-06-03 01:16:11] [INFO ] Flatten gal took : 27 ms
[2025-06-03 01:16:11] [INFO ] Flatten gal took : 28 ms
[2025-06-03 01:16:11] [INFO ] Input system was already deterministic with 956 transitions.
[2025-06-03 01:16:11] [INFO ] Flatten gal took : 26 ms
[2025-06-03 01:16:11] [INFO ] Flatten gal took : 26 ms
[2025-06-03 01:16:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality18332801588953858246.gal : 4 ms
[2025-06-03 01:16:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality9286337774356644713.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/CTLCardinality18332801588953858246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9286337774356644713.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:16:41] [INFO ] Flatten gal took : 28 ms
[2025-06-03 01:16:41] [INFO ] Applying decomposition
[2025-06-03 01:16:41] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12446320885194589798.txt' '-o' '/tmp/graph12446320885194589798.bin' '-w' '/tmp/graph12446320885194589798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12446320885194589798.bin' '-l' '-1' '-v' '-w' '/tmp/graph12446320885194589798.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:16:41] [INFO ] Decomposing Gal with order
[2025-06-03 01:16:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:16:41] [INFO ] Removed a total of 727 redundant transitions.
[2025-06-03 01:16:41] [INFO ] Flatten gal took : 101 ms
[2025-06-03 01:16:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 10 ms.
[2025-06-03 01:16:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality491398134972959122.gal : 6 ms
[2025-06-03 01:16:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5881057888232182365.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/CTLCardinality491398134972959122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5881057888232182365.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 16 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:17:12] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:17:12] [INFO ] Invariant cache hit.
[2025-06-03 01:17:12] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:21] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:21] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:21] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:21] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:21] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:22] [INFO ] Deduced a trap composed of 245 places in 263 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:22] [INFO ] Deduced a trap composed of 121 places in 249 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:23] [INFO ] Deduced a trap composed of 250 places in 282 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:23] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:23] [INFO ] Deduced a trap composed of 233 places in 250 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:24] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 57 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:35] [INFO ] Deduced a trap composed of 212 places in 237 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:41] [INFO ] Deduced a trap composed of 241 places in 286 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:41] [INFO ] Deduced a trap composed of 348 places in 287 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:50] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40499ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40502ms
[2025-06-03 01:17:52] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:17:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:17:53] [INFO ] Implicit Places using invariants in 667 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 669 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 12 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41201 ms. Remains : 516/536 places, 956/968 transitions.
[2025-06-03 01:17:53] [INFO ] Flatten gal took : 25 ms
[2025-06-03 01:17:53] [INFO ] Flatten gal took : 27 ms
[2025-06-03 01:17:53] [INFO ] Input system was already deterministic with 956 transitions.
[2025-06-03 01:17:53] [INFO ] Flatten gal took : 26 ms
[2025-06-03 01:17:53] [INFO ] Flatten gal took : 26 ms
[2025-06-03 01:17:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality15342949482175245949.gal : 5 ms
[2025-06-03 01:17:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality5304231621672903124.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/CTLCardinality15342949482175245949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5304231621672903124.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:18:23] [INFO ] Flatten gal took : 28 ms
[2025-06-03 01:18:23] [INFO ] Applying decomposition
[2025-06-03 01:18:23] [INFO ] Flatten gal took : 27 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/graph7817920909332106083.txt' '-o' '/tmp/graph7817920909332106083.bin' '-w' '/tmp/graph7817920909332106083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7817920909332106083.bin' '-l' '-1' '-v' '-w' '/tmp/graph7817920909332106083.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:18:23] [INFO ] Decomposing Gal with order
[2025-06-03 01:18:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:18:23] [INFO ] Removed a total of 921 redundant transitions.
[2025-06-03 01:18:23] [INFO ] Flatten gal took : 111 ms
[2025-06-03 01:18:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 344 labels/synchronizations in 14 ms.
[2025-06-03 01:18:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality9049663543501551990.gal : 6 ms
[2025-06-03 01:18:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality144705643868367869.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/CTLCardinality9049663543501551990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality144705643868367869.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 534 transition count 926
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 492 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 486 transition count 920
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 96 place count 486 transition count 854
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 228 place count 420 transition count 854
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 288 place count 390 transition count 824
Applied a total of 288 rules in 45 ms. Remains 390 /536 variables (removed 146) and now considering 824/968 (removed 144) transitions.
Running 822 sub problems to find dead transitions.
[2025-06-03 01:18:54] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 390 cols
[2025-06-03 01:18:54] [INFO ] Computed 48 invariants in 10 ms
[2025-06-03 01:18:54] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:01] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:01] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:02] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:02] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:02] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:02] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:04] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:06] [INFO ] Deduced a trap composed of 131 places in 209 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:06] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:10] [INFO ] Deduced a trap composed of 104 places in 179 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:11] [INFO ] Deduced a trap composed of 148 places in 209 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1202 variables, and 57 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:22] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:24] [INFO ] Deduced a trap composed of 127 places in 205 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:29] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:29] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:30] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1202 variables, and 62 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40551ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 40552ms
[2025-06-03 01:19:34] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-03 01:19:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:19:35] [INFO ] Implicit Places using invariants in 1174 ms returned [342, 343, 344, 345, 346, 347]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1175 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 384/536 places, 824/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 378 transition count 818
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 378 transition count 818
Applied a total of 12 rules in 19 ms. Remains 378 /384 variables (removed 6) and now considering 818/824 (removed 6) transitions.
[2025-06-03 01:19:35] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 378 cols
[2025-06-03 01:19:35] [INFO ] Computed 42 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:19:37] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2025-06-03 01:19:37] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:19:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:19:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:19:41] [INFO ] Implicit Places using invariants and state equation in 4502 ms returned []
Implicit Place search using SMT with State Equation took 5651 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 378/536 places, 818/968 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 47446 ms. Remains : 378/536 places, 818/968 transitions.
[2025-06-03 01:19:41] [INFO ] Flatten gal took : 22 ms
[2025-06-03 01:19:41] [INFO ] Flatten gal took : 24 ms
[2025-06-03 01:19:41] [INFO ] Input system was already deterministic with 818 transitions.
[2025-06-03 01:19:41] [INFO ] Flatten gal took : 23 ms
[2025-06-03 01:19:41] [INFO ] Flatten gal took : 23 ms
[2025-06-03 01:19:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality16897701076686007235.gal : 4 ms
[2025-06-03 01:19:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality18291682251529162232.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/CTLCardinality16897701076686007235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18291682251529162232.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:20:11] [INFO ] Flatten gal took : 27 ms
[2025-06-03 01:20:11] [INFO ] Applying decomposition
[2025-06-03 01:20:11] [INFO ] Flatten gal took : 23 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/graph15859793881372487918.txt' '-o' '/tmp/graph15859793881372487918.bin' '-w' '/tmp/graph15859793881372487918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15859793881372487918.bin' '-l' '-1' '-v' '-w' '/tmp/graph15859793881372487918.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:20:11] [INFO ] Decomposing Gal with order
[2025-06-03 01:20:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:20:11] [INFO ] Removed a total of 430 redundant transitions.
[2025-06-03 01:20:11] [INFO ] Flatten gal took : 85 ms
[2025-06-03 01:20:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 318 labels/synchronizations in 7 ms.
[2025-06-03 01:20:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality2116732115703514919.gal : 4 ms
[2025-06-03 01:20:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality18235271303716148809.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/CTLCardinality2116732115703514919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18235271303716148809.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 534 transition count 926
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 492 transition count 926
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 84 place count 492 transition count 908
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 120 place count 474 transition count 908
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 168 place count 450 transition count 884
Applied a total of 168 rules in 27 ms. Remains 450 /536 variables (removed 86) and now considering 884/968 (removed 84) transitions.
Running 882 sub problems to find dead transitions.
[2025-06-03 01:20:42] [INFO ] Flow matrix only has 872 transitions (discarded 12 similar events)
// Phase 1: matrix 872 rows 450 cols
[2025-06-03 01:20:42] [INFO ] Computed 48 invariants in 18 ms
[2025-06-03 01:20:42] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:49] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:49] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:49] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:49] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:49] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 179 places in 228 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 185 places in 229 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:51] [INFO ] Deduced a trap composed of 167 places in 234 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:57] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:00] [INFO ] Deduced a trap composed of 152 places in 202 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/1322 variables, and 59 constraints, problems are : Problem set: 0 solved, 882 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/450 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/1322 variables, and 59 constraints, problems are : Problem set: 0 solved, 882 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/450 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/882 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40488ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 40489ms
[2025-06-03 01:21:22] [INFO ] Flow matrix only has 872 transitions (discarded 12 similar events)
[2025-06-03 01:21:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:21:23] [INFO ] Implicit Places using invariants in 563 ms returned [354, 355, 356, 357, 358, 359]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 565 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 444/536 places, 884/968 transitions.
Applied a total of 0 rules in 12 ms. Remains 444 /444 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41095 ms. Remains : 444/536 places, 884/968 transitions.
[2025-06-03 01:21:23] [INFO ] Flatten gal took : 24 ms
[2025-06-03 01:21:23] [INFO ] Flatten gal took : 26 ms
[2025-06-03 01:21:23] [INFO ] Input system was already deterministic with 884 transitions.
[2025-06-03 01:21:23] [INFO ] Flatten gal took : 36 ms
[2025-06-03 01:21:23] [INFO ] Flatten gal took : 38 ms
[2025-06-03 01:21:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality5281507213624920936.gal : 4 ms
[2025-06-03 01:21:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality2585753605828996740.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5281507213624920936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2585753605828996740.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:21:53] [INFO ] Flatten gal took : 28 ms
[2025-06-03 01:21:53] [INFO ] Applying decomposition
[2025-06-03 01:21:53] [INFO ] Flatten gal took : 26 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/graph16607111641474087494.txt' '-o' '/tmp/graph16607111641474087494.bin' '-w' '/tmp/graph16607111641474087494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16607111641474087494.bin' '-l' '-1' '-v' '-w' '/tmp/graph16607111641474087494.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:21:53] [INFO ] Decomposing Gal with order
[2025-06-03 01:21:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:21:53] [INFO ] Removed a total of 1004 redundant transitions.
[2025-06-03 01:21:53] [INFO ] Flatten gal took : 82 ms
[2025-06-03 01:21:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 7 ms.
[2025-06-03 01:21:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality5808744774635309740.gal : 6 ms
[2025-06-03 01:21:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality3342469482442369276.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/CTLCardinality5808744774635309740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3342469482442369276.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:22:23] [INFO ] Flatten gal took : 28 ms
[2025-06-03 01:22:23] [INFO ] Flatten gal took : 27 ms
[2025-06-03 01:22:23] [INFO ] Applying decomposition
[2025-06-03 01:22:23] [INFO ] Flatten gal took : 28 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/graph2755443412860203734.txt' '-o' '/tmp/graph2755443412860203734.bin' '-w' '/tmp/graph2755443412860203734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2755443412860203734.bin' '-l' '-1' '-v' '-w' '/tmp/graph2755443412860203734.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:22:24] [INFO ] Decomposing Gal with order
[2025-06-03 01:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:22:24] [INFO ] Removed a total of 1203 redundant transitions.
[2025-06-03 01:22:24] [INFO ] Flatten gal took : 76 ms
[2025-06-03 01:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 303 labels/synchronizations in 13 ms.
[2025-06-03 01:22:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality15863395006944308612.gal : 6 ms
[2025-06-03 01:22:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality18208859843067589753.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/CTLCardinality15863395006944308612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18208859843067589753.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 7 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:48:15] [INFO ] Applying decomposition
[2025-06-03 01:48:15] [INFO ] Flatten gal took : 124 ms
[2025-06-03 01:48:15] [INFO ] Decomposing Gal with order
[2025-06-03 01:48:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:48:15] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-03 01:48:15] [INFO ] Flatten gal took : 115 ms
[2025-06-03 01:48:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality1308602007076838251.gal : 91 ms
[2025-06-03 01:48:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality997425338253694914.ctl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1308602007076838251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality997425338253694914.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J06T06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253700289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;