Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K 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 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 144K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 862K 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-PT-S02J04T06-CTLCardinality-2025-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748968493194

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 16:34:54] [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 16:34:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 16:34:54] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2025-06-03 16:34:54] [INFO ] Transformed 476 places.
[2025-06-03 16:34:54] [INFO ] Transformed 920 transitions.
[2025-06-03 16:34:54] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 353 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Applied a total of 0 rules in 35 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2025-06-03 16:34:54] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2025-06-03 16:34:54] [INFO ] Computed 46 invariants in 57 ms
[2025-06-03 16:34: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/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 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 16:35:02] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:02] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:02] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:02] [INFO ] Deduced a trap composed of 65 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 16:35:02] [INFO ] Deduced a trap composed of 65 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 16:35:02] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:03] [INFO ] Deduced a trap composed of 260 places in 214 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:03] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:04] [INFO ] Deduced a trap composed of 133 places in 220 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:04] [INFO ] Deduced a trap composed of 229 places in 222 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:04] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:04] [INFO ] Deduced a trap composed of 223 places in 245 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:06] [INFO ] Deduced a trap composed of 252 places in 210 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:06] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:09] [INFO ] Deduced a trap composed of 235 places in 249 ms of which 79 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 51 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20079 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 15/15 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/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 51 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40836ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 40863ms
[2025-06-03 16:35:35] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-03 16:35:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:35:35] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-06-03 16:35:35] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-03 16:35:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:35:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:35:38] [INFO ] Implicit Places using invariants and state equation in 2547 ms returned []
Implicit Place search using SMT with State Equation took 2840 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2025-06-03 16:35:38] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-03 16:35:38] [INFO ] Invariant cache hit.
[2025-06-03 16:35:38] [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/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 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 16:35:45] [INFO ] Deduced a trap composed of 65 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 16:35:45] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:45] [INFO ] Deduced a trap composed of 65 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 16:35:45] [INFO ] Deduced a trap composed of 65 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 16:35:45] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:45] [INFO ] Deduced a trap composed of 65 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 16:35:46] [INFO ] Deduced a trap composed of 260 places in 241 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:46] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:46] [INFO ] Deduced a trap composed of 133 places in 233 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:47] [INFO ] Deduced a trap composed of 229 places in 238 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:47] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:47] [INFO ] Deduced a trap composed of 223 places in 258 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:48] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:49] [INFO ] Deduced a trap composed of 252 places in 231 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:35:52] [INFO ] Deduced a trap composed of 235 places in 255 ms of which 78 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 15/51 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 16:36:08] [INFO ] Deduced a trap composed of 200 places in 214 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 52 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 16/52 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 16:36:26] [INFO ] Deduced a trap composed of 252 places in 252 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:28] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:28] [INFO ] Deduced a trap composed of 3 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 16:36:28] [INFO ] Deduced a trap composed of 28 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 16:36:29] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:29] [INFO ] Deduced a trap composed of 247 places in 253 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:29] [INFO ] Deduced a trap composed of 222 places in 248 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:30] [INFO ] Deduced a trap composed of 252 places in 244 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:30] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:30] [INFO ] Deduced a trap composed of 182 places in 234 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:31] [INFO ] Deduced a trap composed of 222 places in 252 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:31] [INFO ] Deduced a trap composed of 226 places in 229 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:32] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:32] [INFO ] Deduced a trap composed of 238 places in 204 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:34] [INFO ] Deduced a trap composed of 264 places in 214 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:34] [INFO ] Deduced a trap composed of 274 places in 232 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:34] [INFO ] Deduced a trap composed of 254 places in 210 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:38] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 38 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 70 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Finished structural reductions in LTL mode , in 1 iterations and 104194 ms. Remains : 476/476 places, 824/824 transitions.
Support contains 353 out of 476 places after structural reductions.
[2025-06-03 16:36:39] [INFO ] Flatten gal took : 88 ms
[2025-06-03 16:36:39] [INFO ] Flatten gal took : 61 ms
[2025-06-03 16:36:39] [INFO ] Input system was already deterministic with 824 transitions.
RANDOM walk for 40000 steps (13 resets) in 1984 ms. (20 steps per ms) remains 70/115 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (9 resets) in 37 ms. (105 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (9 resets) in 56 ms. (70 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 70/70 properties
[2025-06-03 16:36:40] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-03 16:36:40] [INFO ] Invariant cache hit.
[2025-06-03 16:36:40] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp104 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 7/9 constraints. Problems are: Problem set: 4 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 66 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp114 is UNSAT
At refinement iteration 3 (OVERLAPS) 77/315 variables, 7/16 constraints. Problems are: Problem set: 16 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 4/20 constraints. Problems are: Problem set: 16 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/20 constraints. Problems are: Problem set: 16 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/316 variables, 1/21 constraints. Problems are: Problem set: 16 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/21 constraints. Problems are: Problem set: 16 solved, 54 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp102 is UNSAT
Problem AtomicPropp105 is UNSAT
Problem AtomicPropp107 is UNSAT
Problem AtomicPropp108 is UNSAT
Problem AtomicPropp109 is UNSAT
Problem AtomicPropp113 is UNSAT
At refinement iteration 8 (OVERLAPS) 158/474 variables, 24/45 constraints. Problems are: Problem set: 64 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:42] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:42] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:42] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:43] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:43] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:43] [INFO ] Deduced a trap composed of 223 places in 241 ms of which 76 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 6/51 constraints. Problems are: Problem set: 64 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/51 constraints. Problems are: Problem set: 64 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 812/1286 variables, 474/525 constraints. Problems are: Problem set: 64 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1286 variables, 72/597 constraints. Problems are: Problem set: 64 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1286 variables, 0/597 constraints. Problems are: Problem set: 64 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/1288 variables, 2/599 constraints. Problems are: Problem set: 64 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1288 variables, 1/600 constraints. Problems are: Problem set: 64 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1288 variables, 0/600 constraints. Problems are: Problem set: 64 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1288/1288 variables, and 600 constraints, problems are : Problem set: 64 solved, 6 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 476/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 64 solved, 6 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: 64 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 39/58 variables, 2/2 constraints. Problems are: Problem set: 64 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 64 solved, 6 unsolved
Problem AtomicPropp77 is UNSAT
At refinement iteration 3 (OVERLAPS) 395/453 variables, 27/29 constraints. Problems are: Problem set: 65 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/29 constraints. Problems are: Problem set: 65 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 8/461 variables, 8/37 constraints. Problems are: Problem set: 65 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/37 constraints. Problems are: Problem set: 65 solved, 5 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 7 (OVERLAPS) 13/474 variables, 8/45 constraints. Problems are: Problem set: 67 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 6/51 constraints. Problems are: Problem set: 67 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:46] [INFO ] Deduced a trap composed of 211 places in 219 ms of which 51 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 1/52 constraints. Problems are: Problem set: 67 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/52 constraints. Problems are: Problem set: 67 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 812/1286 variables, 474/526 constraints. Problems are: Problem set: 67 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1286 variables, 72/598 constraints. Problems are: Problem set: 67 solved, 3 unsolved
Problem AtomicPropp84 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1286/1288 variables, and 600 constraints, problems are : Problem set: 68 solved, 2 unsolved in 2819 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 474/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/70 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7896ms problems are : Problem set: 68 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 295 ms.
Support contains 8 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 474 transition count 788
Reduce places removed 36 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 48 rules applied. Total rules applied 86 place count 438 transition count 776
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 98 place count 426 transition count 776
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 98 place count 426 transition count 722
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 206 place count 372 transition count 722
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 3 with 48 rules applied. Total rules applied 254 place count 348 transition count 698
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 260 place count 348 transition count 698
Applied a total of 260 rules in 133 ms. Remains 348 /476 variables (removed 128) and now considering 698/824 (removed 126) transitions.
Running 696 sub problems to find dead transitions.
[2025-06-03 16:36:49] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
// Phase 1: matrix 686 rows 348 cols
[2025-06-03 16:36:49] [INFO ] Computed 44 invariants in 13 ms
[2025-06-03 16:36:49] [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/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:53] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:53] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:53] [INFO ] Deduced a trap composed of 44 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 16:36:54] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:54] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:54] [INFO ] Deduced a trap composed of 44 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 16:36:54] [INFO ] Deduced a trap composed of 44 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 16:36:54] [INFO ] Deduced a trap composed of 115 places in 164 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:55] [INFO ] Deduced a trap composed of 120 places in 180 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:55] [INFO ] Deduced a trap composed of 44 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 16:36:55] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:56] [INFO ] Deduced a trap composed of 202 places in 170 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:58] [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 16:36:58] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:58] [INFO ] Deduced a trap composed of 115 places in 178 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:36:59] [INFO ] Deduced a trap composed of 126 places in 183 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:02] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:06] [INFO ] Deduced a trap composed of 121 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 16:37:06] [INFO ] Deduced a trap composed of 126 places in 186 ms of which 42 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1034 variables, and 61 constraints, problems are : Problem set: 0 solved, 696 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 696 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 346/1034 variables, and 61 constraints, problems are : Problem set: 0 solved, 696 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/696 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40353ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 40355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40490 ms. Remains : 348/476 places, 698/824 transitions.
RANDOM walk for 40000 steps (18 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 181649 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 181649 steps, saw 101878 distinct states, run finished after 3006 ms. (steps per millisecond=60 ) properties seen :0
[2025-06-03 16:37:32] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-03 16:37:32] [INFO ] Invariant cache hit.
[2025-06-03 16:37:32] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 190/198 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 109/307 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/313 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/344 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/346 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 686/1032 variables, 346/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1032 variables, 72/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1032 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1034 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1034 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1034 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1034 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1034/1034 variables, and 464 constraints, problems are : Problem set: 0 solved, 2 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 190/198 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 109/307 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:33] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:33] [INFO ] Deduced a trap composed of 84 places in 162 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:34] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/313 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 31/344 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:34] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:34] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:34] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:34] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:34] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/346 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 686/1032 variables, 346/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1032 variables, 72/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1032 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1032 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1034 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1034 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/1034 variables, 1/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:37] [INFO ] Deduced a trap composed of 121 places in 189 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:37] [INFO ] Deduced a trap composed of 126 places in 193 ms of which 49 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1034 variables, 2/476 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1034 variables, 0/476 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1034 variables, 0/476 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1034/1034 variables, and 476 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4603 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 348/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5420ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 698/698 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 330 transition count 680
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 330 transition count 674
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 324 transition count 674
Applied a total of 48 rules in 46 ms. Remains 324 /348 variables (removed 24) and now considering 674/698 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 324/348 places, 674/698 transitions.
RANDOM walk for 40000 steps (14 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (13 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 259923 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 259923 steps, saw 145788 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2025-06-03 16:37:41] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 324 cols
[2025-06-03 16:37:41] [INFO ] Computed 44 invariants in 17 ms
[2025-06-03 16:37:41] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 239/245 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 43/288 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/322 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 662/984 variables, 322/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/984 variables, 72/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/984 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/986 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/986 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/986 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/986 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 986/986 variables, and 440 constraints, problems are : Problem set: 0 solved, 1 unsolved in 680 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 324/324 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 239/245 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/288 variables, 14/31 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 16:37:42] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/322 variables, 12/44 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 16:37:42] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:42] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:42] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:42] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 662/984 variables, 322/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/984 variables, 72/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/984 variables, 1/443 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 16:37:43] [INFO ] Deduced a trap composed of 108 places in 171 ms of which 24 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/984 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/984 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/986 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/986 variables, 1/447 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 16:37:44] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 19 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/986 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/986 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/986 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 986/986 variables, and 448 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2288 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 324/324 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2993ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 674/674 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 324/324 places, 674/674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 674/674 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2025-06-03 16:37:44] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-03 16:37:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:37:45] [INFO ] Implicit Places using invariants in 996 ms returned [81, 163, 185, 187, 285, 297]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1000 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 318/324 places, 674/674 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 314 transition count 670
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 314 transition count 670
Applied a total of 8 rules in 26 ms. Remains 314 /318 variables (removed 4) and now considering 670/674 (removed 4) transitions.
[2025-06-03 16:37:45] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
// Phase 1: matrix 658 rows 314 cols
[2025-06-03 16:37:45] [INFO ] Computed 38 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:37:46] [INFO ] Implicit Places using invariants in 847 ms returned []
[2025-06-03 16:37:46] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
[2025-06-03 16:37:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:37:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:37:50] [INFO ] Implicit Places using invariants and state equation in 4258 ms returned []
Implicit Place search using SMT with State Equation took 5107 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 314/324 places, 670/674 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6149 ms. Remains : 314/324 places, 670/674 transitions.
RANDOM walk for 40000 steps (24 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (14 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 262986 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 262986 steps, saw 139819 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2025-06-03 16:37:53] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
[2025-06-03 16:37:53] [INFO ] Invariant cache hit.
[2025-06-03 16:37:53] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/233 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/272 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/311 variables, 13/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 16:37:53] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:53] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:53] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:53] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/312 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 658/970 variables, 312/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/970 variables, 72/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/970 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/972 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/972 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/972 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/972 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 428 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 314/314 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/233 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/272 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/311 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/40 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 16:37:54] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:55] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:55] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:37:55] [INFO ] Deduced a trap composed of 100 places in 170 ms of which 35 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/312 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 658/970 variables, 312/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/970 variables, 72/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/970 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/970 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/972 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/972 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/972 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/972 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 972/972 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1607 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 314/314 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2691ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 670/670 transitions.
Applied a total of 0 rules in 25 ms. Remains 314 /314 variables (removed 0) and now considering 670/670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 314/314 places, 670/670 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 670/670 transitions.
Applied a total of 0 rules in 12 ms. Remains 314 /314 variables (removed 0) and now considering 670/670 (removed 0) transitions.
[2025-06-03 16:37:56] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
[2025-06-03 16:37:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:37:57] [INFO ] Implicit Places using invariants in 846 ms returned []
[2025-06-03 16:37:57] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
[2025-06-03 16:37:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:37:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:38:01] [INFO ] Implicit Places using invariants and state equation in 4243 ms returned []
Implicit Place search using SMT with State Equation took 5091 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 16:38:01] [INFO ] Redundant transitions in 41 ms returned []
Running 668 sub problems to find dead transitions.
[2025-06-03 16:38:01] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
[2025-06-03 16:38:01] [INFO ] Invariant cache hit.
[2025-06-03 16:38:01] [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/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:05] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:05] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:06] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:06] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:06] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:06] [INFO ] Deduced a trap composed of 41 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 16:38:06] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:06] [INFO ] Deduced a trap composed of 40 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 16:38:07] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:07] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:08] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:09] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/314 variables, 2/50 constraints. Problems are: Problem set: 66 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:27] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:27] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:28] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:31] [INFO ] Deduced a trap composed of 95 places in 186 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:38:31] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/972 variables, and 55 constraints, problems are : Problem set: 66 solved, 602 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/314 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 66 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 22/36 constraints. Problems are: Problem set: 66 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 13/49 constraints. Problems are: Problem set: 66 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/49 constraints. Problems are: Problem set: 66 solved, 602 unsolved
At refinement iteration 4 (OVERLAPS) 2/314 variables, 2/51 constraints. Problems are: Problem set: 66 solved, 602 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 4/55 constraints. Problems are: Problem set: 66 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/972 variables, and 55 constraints, problems are : Problem set: 66 solved, 602 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/314 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/668 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 66 solved, 602 unsolved
Search for dead transitions found 66 dead transitions in 60426ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 314/314 places, 604/670 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 592
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 300 transition count 580
Applied a total of 14 rules in 15 ms. Remains 300 /314 variables (removed 14) and now considering 580/604 (removed 24) transitions.
[2025-06-03 16:39:01] [INFO ] Flow matrix only has 568 transitions (discarded 12 similar events)
// Phase 1: matrix 568 rows 300 cols
[2025-06-03 16:39:01] [INFO ] Computed 38 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:39:02] [INFO ] Implicit Places using invariants in 778 ms returned []
[2025-06-03 16:39:02] [INFO ] Flow matrix only has 568 transitions (discarded 12 similar events)
[2025-06-03 16:39:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:39:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:39:05] [INFO ] Implicit Places using invariants and state equation in 3147 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 300/314 places, 580/670 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69528 ms. Remains : 300/314 places, 580/670 transitions.
Successfully simplified 69 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 16:39:05] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-03 16:39:05] [INFO ] Flatten gal took : 43 ms
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 16:39:05] [INFO ] Flatten gal took : 37 ms
[2025-06-03 16:39:06] [INFO ] Input system was already deterministic with 824 transitions.
Support contains 127 out of 476 places (down from 195) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Applied a total of 2 rules in 8 ms. Remains 474 /476 variables (removed 2) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2025-06-03 16:39:06] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 474 cols
[2025-06-03 16:39:06] [INFO ] Computed 44 invariants in 21 ms
[2025-06-03 16:39:06] [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/472 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 28/42 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 16:39:13] [INFO ] Deduced a trap composed of 65 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 16:39:13] [INFO ] Deduced a trap composed of 65 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 16:39:13] [INFO ] Deduced a trap composed of 65 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 16:39:13] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:13] [INFO ] Deduced a trap composed of 65 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 16:39:13] [INFO ] Deduced a trap composed of 65 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 16:39:14] [INFO ] Deduced a trap composed of 133 places in 201 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:14] [INFO ] Deduced a trap composed of 205 places in 246 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:14] [INFO ] Deduced a trap composed of 217 places in 246 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:14] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:15] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:15] [INFO ] Deduced a trap composed of 223 places in 240 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:17] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:18] [INFO ] Deduced a trap composed of 229 places in 248 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:19] [INFO ] Deduced a trap composed of 217 places in 265 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:19] [INFO ] Deduced a trap composed of 223 places in 221 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:19] [INFO ] Deduced a trap composed of 235 places in 252 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:23] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:23] [INFO ] Deduced a trap composed of 294 places in 243 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:39:23] [INFO ] Deduced a trap composed of 288 places in 267 ms of which 92 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1286 variables, and 62 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/474 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 20/20 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/472 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1286 variables, and 62 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/474 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40392ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 40394ms
[2025-06-03 16:39:46] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-03 16:39:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:39:47] [INFO ] Implicit Places using invariants in 555 ms returned [112, 240, 278, 281, 422, 434]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 557 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 468/476 places, 824/824 transitions.
Applied a total of 0 rules in 6 ms. Remains 468 /468 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40969 ms. Remains : 468/476 places, 824/824 transitions.
[2025-06-03 16:39:47] [INFO ] Flatten gal took : 33 ms
[2025-06-03 16:39:47] [INFO ] Flatten gal took : 36 ms
[2025-06-03 16:39:47] [INFO ] Input system was already deterministic with 824 transitions.
[2025-06-03 16:39:47] [INFO ] Flatten gal took : 29 ms
[2025-06-03 16:39:47] [INFO ] Flatten gal took : 29 ms
[2025-06-03 16:39:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality18072440564035669112.gal : 21 ms
[2025-06-03 16:39:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality13224518258335692891.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/CTLCardinality18072440564035669112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13224518258335692891.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 16:40:17] [INFO ] Flatten gal took : 30 ms
[2025-06-03 16:40:17] [INFO ] Applying decomposition
[2025-06-03 16:40:17] [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/graph6905044462459805765.txt' '-o' '/tmp/graph6905044462459805765.bin' '-w' '/tmp/graph6905044462459805765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6905044462459805765.bin' '-l' '-1' '-v' '-w' '/tmp/graph6905044462459805765.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:40:17] [INFO ] Decomposing Gal with order
[2025-06-03 16:40:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:40:17] [INFO ] Removed a total of 1036 redundant transitions.
[2025-06-03 16:40:17] [INFO ] Flatten gal took : 145 ms
[2025-06-03 16:40:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 388 labels/synchronizations in 49 ms.
[2025-06-03 16:40:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality8866886172288714489.gal : 12 ms
[2025-06-03 16:40:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality13313742149129647460.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/CTLCardinality8866886172288714489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13313742149129647460.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 : 476/476 places, 824/824 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 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 420 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 108 place count 420 transition count 722
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 204 place count 372 transition count 722
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 300 place count 324 transition count 674
Applied a total of 300 rules in 46 ms. Remains 324 /476 variables (removed 152) and now considering 674/824 (removed 150) transitions.
Running 672 sub problems to find dead transitions.
[2025-06-03 16:40:48] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 324 cols
[2025-06-03 16:40:48] [INFO ] Computed 44 invariants in 15 ms
[2025-06-03 16:40:48] [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/322 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:52] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:52] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:52] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:52] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:52] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:52] [INFO ] Deduced a trap composed of 40 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 16:40:52] [INFO ] Deduced a trap composed of 40 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 16:40:53] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:53] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:54] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:54] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:55] [INFO ] Deduced a trap composed of 103 places in 172 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:55] [INFO ] Deduced a trap composed of 181 places in 174 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:58] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:59] [INFO ] Deduced a trap composed of 119 places in 182 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:59] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:40:59] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:41:06] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 23 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 (/ 3.0 4.0))
(s3 9.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 (/ 3.0 4.0))
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/986 variables, and 59 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:41:20] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:41:25] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:41:25] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/986 variables, and 62 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40357ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 40359ms
[2025-06-03 16:41:28] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-03 16:41:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:29] [INFO ] Implicit Places using invariants in 880 ms returned [81, 164, 187, 189, 286, 298]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 884 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 318/476 places, 674/824 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 314 transition count 670
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 314 transition count 670
Applied a total of 8 rules in 23 ms. Remains 314 /318 variables (removed 4) and now considering 670/674 (removed 4) transitions.
[2025-06-03 16:41:29] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
// Phase 1: matrix 658 rows 314 cols
[2025-06-03 16:41:29] [INFO ] Computed 38 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:30] [INFO ] Implicit Places using invariants in 888 ms returned []
[2025-06-03 16:41:30] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
[2025-06-03 16:41:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:41:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:41:35] [INFO ] Implicit Places using invariants and state equation in 4720 ms returned []
Implicit Place search using SMT with State Equation took 5612 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 314/476 places, 670/824 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 46926 ms. Remains : 314/476 places, 670/824 transitions.
[2025-06-03 16:41:35] [INFO ] Flatten gal took : 34 ms
[2025-06-03 16:41:35] [INFO ] Flatten gal took : 29 ms
[2025-06-03 16:41:35] [INFO ] Input system was already deterministic with 670 transitions.
[2025-06-03 16:41:35] [INFO ] Flatten gal took : 25 ms
[2025-06-03 16:41:35] [INFO ] Flatten gal took : 25 ms
[2025-06-03 16:41:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality265395991501120018.gal : 4 ms
[2025-06-03 16:41:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality1701410284238505690.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/CTLCardinality265395991501120018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1701410284238505690.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.
[2025-06-03 16:42:05] [INFO ] Flatten gal took : 28 ms
[2025-06-03 16:42:05] [INFO ] Applying decomposition
[2025-06-03 16:42:05] [INFO ] Flatten gal took : 24 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/graph1281752345721421652.txt' '-o' '/tmp/graph1281752345721421652.bin' '-w' '/tmp/graph1281752345721421652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1281752345721421652.bin' '-l' '-1' '-v' '-w' '/tmp/graph1281752345721421652.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:42:05] [INFO ] Decomposing Gal with order
[2025-06-03 16:42:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:42:05] [INFO ] Removed a total of 586 redundant transitions.
[2025-06-03 16:42:05] [INFO ] Flatten gal took : 68 ms
[2025-06-03 16:42:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 231 labels/synchronizations in 16 ms.
[2025-06-03 16:42:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality10748181122002934140.gal : 6 ms
[2025-06-03 16:42:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality12228099808492305620.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/CTLCardinality10748181122002934140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12228099808492305620.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Applied a total of 2 rules in 14 ms. Remains 474 /476 variables (removed 2) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2025-06-03 16:42:35] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 474 cols
[2025-06-03 16:42:35] [INFO ] Computed 44 invariants in 14 ms
[2025-06-03 16:42:35] [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/472 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 28/42 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 16:42:42] [INFO ] Deduced a trap composed of 65 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 16:42:42] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:42] [INFO ] Deduced a trap composed of 65 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 16:42:42] [INFO ] Deduced a trap composed of 65 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 16:42:43] [INFO ] Deduced a trap composed of 65 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 16:42:43] [INFO ] Deduced a trap composed of 65 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 16:42:43] [INFO ] Deduced a trap composed of 133 places in 202 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:44] [INFO ] Deduced a trap composed of 205 places in 249 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:44] [INFO ] Deduced a trap composed of 217 places in 239 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:44] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:44] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:45] [INFO ] Deduced a trap composed of 223 places in 254 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:47] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:48] [INFO ] Deduced a trap composed of 229 places in 256 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:49] [INFO ] Deduced a trap composed of 217 places in 266 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:49] [INFO ] Deduced a trap composed of 223 places in 224 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:49] [INFO ] Deduced a trap composed of 235 places in 259 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:53] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:53] [INFO ] Deduced a trap composed of 294 places in 244 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:42:53] [INFO ] Deduced a trap composed of 288 places in 268 ms of which 93 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1286 variables, and 62 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/474 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 20/20 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/472 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1286 variables, and 62 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/474 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40376ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 40378ms
[2025-06-03 16:43:16] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-03 16:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:43:16] [INFO ] Implicit Places using invariants in 860 ms returned [112, 240, 278, 281, 422, 434]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 863 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 468/476 places, 824/824 transitions.
Applied a total of 0 rules in 10 ms. Remains 468 /468 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41268 ms. Remains : 468/476 places, 824/824 transitions.
[2025-06-03 16:43:16] [INFO ] Flatten gal took : 24 ms
[2025-06-03 16:43:16] [INFO ] Flatten gal took : 26 ms
[2025-06-03 16:43:17] [INFO ] Input system was already deterministic with 824 transitions.
[2025-06-03 16:43:17] [INFO ] Flatten gal took : 25 ms
[2025-06-03 16:43:17] [INFO ] Flatten gal took : 23 ms
[2025-06-03 16:43:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality17979038230796415296.gal : 5 ms
[2025-06-03 16:43:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality6697818625321398255.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/CTLCardinality17979038230796415296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6697818625321398255.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 16:43:47] [INFO ] Flatten gal took : 25 ms
[2025-06-03 16:43:47] [INFO ] Applying decomposition
[2025-06-03 16:43:47] [INFO ] Flatten gal took : 24 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/graph521876369602086472.txt' '-o' '/tmp/graph521876369602086472.bin' '-w' '/tmp/graph521876369602086472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph521876369602086472.bin' '-l' '-1' '-v' '-w' '/tmp/graph521876369602086472.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:43:47] [INFO ] Decomposing Gal with order
[2025-06-03 16:43:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:43:47] [INFO ] Removed a total of 1009 redundant transitions.
[2025-06-03 16:43:47] [INFO ] Flatten gal took : 65 ms
[2025-06-03 16:43:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 477 labels/synchronizations in 46 ms.
[2025-06-03 16:43:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality759228828485761358.gal : 7 ms
[2025-06-03 16:43:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality12527784398557845591.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/CTLCardinality759228828485761358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12527784398557845591.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 462 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 462 transition count 812
Applied a total of 26 rules in 16 ms. Remains 462 /476 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:44:17] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 462 cols
[2025-06-03 16:44:17] [INFO ] Computed 44 invariants in 17 ms
[2025-06-03 16:44:17] [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/460 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 25/42 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 16:44:26] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:26] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:26] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:26] [INFO ] Deduced a trap composed of 63 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 16:44:26] [INFO ] Deduced a trap composed of 63 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 16:44:26] [INFO ] Deduced a trap composed of 63 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 16:44:27] [INFO ] Deduced a trap composed of 121 places in 224 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:27] [INFO ] Deduced a trap composed of 205 places in 229 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:27] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:28] [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 16:44:28] [INFO ] Deduced a trap composed of 222 places in 220 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:30] [INFO ] Deduced a trap composed of 205 places in 244 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:31] [INFO ] Deduced a trap composed of 217 places in 245 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:31] [INFO ] Deduced a trap composed of 298 places in 242 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:32] [INFO ] Deduced a trap composed of 217 places in 241 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:44:32] [INFO ] Deduced a trap composed of 222 places in 234 ms of which 70 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1262 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 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/460 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1262 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40421ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40424ms
[2025-06-03 16:44:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:44:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:44:58] [INFO ] Implicit Places using invariants in 850 ms returned [112, 235, 271, 274, 410, 422]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 852 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/476 places, 812/824 transitions.
Applied a total of 0 rules in 7 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41300 ms. Remains : 456/476 places, 812/824 transitions.
[2025-06-03 16:44:58] [INFO ] Flatten gal took : 27 ms
[2025-06-03 16:44:58] [INFO ] Flatten gal took : 24 ms
[2025-06-03 16:44:59] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 16:44:59] [INFO ] Flatten gal took : 24 ms
[2025-06-03 16:44:59] [INFO ] Flatten gal took : 30 ms
[2025-06-03 16:44:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality10516889059789166898.gal : 4 ms
[2025-06-03 16:44:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality14086463109967483020.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/CTLCardinality10516889059789166898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14086463109967483020.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 16:45:29] [INFO ] Flatten gal took : 22 ms
[2025-06-03 16:45:29] [INFO ] Applying decomposition
[2025-06-03 16:45:29] [INFO ] Flatten gal took : 22 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/graph6186105028358663177.txt' '-o' '/tmp/graph6186105028358663177.bin' '-w' '/tmp/graph6186105028358663177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6186105028358663177.bin' '-l' '-1' '-v' '-w' '/tmp/graph6186105028358663177.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:45:29] [INFO ] Decomposing Gal with order
[2025-06-03 16:45:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:45:29] [INFO ] Removed a total of 571 redundant transitions.
[2025-06-03 16:45:29] [INFO ] Flatten gal took : 61 ms
[2025-06-03 16:45:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 280 labels/synchronizations in 11 ms.
[2025-06-03 16:45:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality7344326724945650496.gal : 9 ms
[2025-06-03 16:45:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality12586583121265117241.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/CTLCardinality7344326724945650496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12586583121265117241.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 462 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 462 transition count 812
Applied a total of 26 rules in 16 ms. Remains 462 /476 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:45:59] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:45:59] [INFO ] Invariant cache hit.
[2025-06-03 16:45: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/460 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 25/42 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 16:46:08] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:08] [INFO ] Deduced a trap composed of 63 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 16:46:08] [INFO ] Deduced a trap composed of 63 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 16:46:08] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:08] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:08] [INFO ] Deduced a trap composed of 63 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 16:46:09] [INFO ] Deduced a trap composed of 121 places in 202 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:09] [INFO ] Deduced a trap composed of 205 places in 246 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:09] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:09] [INFO ] Deduced a trap composed of 222 places in 244 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:10] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:12] [INFO ] Deduced a trap composed of 217 places in 216 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:13] [INFO ] Deduced a trap composed of 205 places in 240 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:13] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:13] [INFO ] Deduced a trap composed of 217 places in 235 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:14] [INFO ] Deduced a trap composed of 222 places in 239 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:46:17] [INFO ] Deduced a trap composed of 298 places in 257 ms of which 86 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1262 variables, and 59 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 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/460 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1262 variables, and 59 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40402ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40404ms
[2025-06-03 16:46:39] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:46:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:46:40] [INFO ] Implicit Places using invariants in 833 ms returned [112, 235, 271, 274, 410, 422]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 836 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/476 places, 812/824 transitions.
Applied a total of 0 rules in 8 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41266 ms. Remains : 456/476 places, 812/824 transitions.
[2025-06-03 16:46:40] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:46:40] [INFO ] Flatten gal took : 22 ms
[2025-06-03 16:46:40] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 16:46:40] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:46:40] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:46:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality7699416237177466617.gal : 4 ms
[2025-06-03 16:46:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality14459818302694223176.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/CTLCardinality7699416237177466617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14459818302694223176.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 16:47:10] [INFO ] Flatten gal took : 22 ms
[2025-06-03 16:47:10] [INFO ] Applying decomposition
[2025-06-03 16:47:10] [INFO ] Flatten gal took : 22 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/graph17991400507695692499.txt' '-o' '/tmp/graph17991400507695692499.bin' '-w' '/tmp/graph17991400507695692499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17991400507695692499.bin' '-l' '-1' '-v' '-w' '/tmp/graph17991400507695692499.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:47:11] [INFO ] Decomposing Gal with order
[2025-06-03 16:47:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:47:11] [INFO ] Removed a total of 727 redundant transitions.
[2025-06-03 16:47:11] [INFO ] Flatten gal took : 45 ms
[2025-06-03 16:47:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 6 ms.
[2025-06-03 16:47:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality299496744997500270.gal : 6 ms
[2025-06-03 16:47:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality16285960440421664356.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/CTLCardinality299496744997500270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16285960440421664356.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 470 transition count 818
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 470 transition count 818
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 464 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 464 transition count 812
Applied a total of 24 rules in 14 ms. Remains 464 /476 variables (removed 12) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:47:41] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 464 cols
[2025-06-03 16:47:41] [INFO ] Computed 46 invariants in 16 ms
[2025-06-03 16:47: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/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 27/41 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 16:47:47] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:47] [INFO ] Deduced a trap composed of 63 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 16:47:47] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:47] [INFO ] Deduced a trap composed of 63 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 16:47:47] [INFO ] Deduced a trap composed of 63 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 16:47:48] [INFO ] Deduced a trap composed of 63 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 16:47:48] [INFO ] Deduced a trap composed of 121 places in 223 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:49] [INFO ] Deduced a trap composed of 210 places in 213 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:49] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:49] [INFO ] Deduced a trap composed of 222 places in 238 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:50] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:52] [INFO ] Deduced a trap composed of 217 places in 252 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:53] [INFO ] Deduced a trap composed of 210 places in 221 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:53] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:53] [INFO ] Deduced a trap composed of 222 places in 229 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:54] [INFO ] Deduced a trap composed of 227 places in 223 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:55] [INFO ] Deduced a trap composed of 287 places in 225 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:47:58] [INFO ] Deduced a trap composed of 86 places in 205 ms of which 49 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1264 variables, and 59 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/32 constraints, State Equation: 0/464 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 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/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 18/59 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 16:48:21] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1264 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/32 constraints, State Equation: 0/464 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40381ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40383ms
[2025-06-03 16:48:21] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:48:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:48:22] [INFO ] Implicit Places using invariants in 736 ms returned [113, 236, 272, 275, 412, 424]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 739 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/476 places, 812/824 transitions.
Applied a total of 0 rules in 8 ms. Remains 458 /458 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41145 ms. Remains : 458/476 places, 812/824 transitions.
[2025-06-03 16:48:22] [INFO ] Flatten gal took : 26 ms
[2025-06-03 16:48:22] [INFO ] Flatten gal took : 22 ms
[2025-06-03 16:48:22] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 16:48:22] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:48:22] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:48:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality12369625373014254069.gal : 4 ms
[2025-06-03 16:48:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality374714419309628265.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/CTLCardinality12369625373014254069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality374714419309628265.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 16:48:52] [INFO ] Flatten gal took : 27 ms
[2025-06-03 16:48:52] [INFO ] Applying decomposition
[2025-06-03 16:48:52] [INFO ] Flatten gal took : 21 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/graph15428402043541014458.txt' '-o' '/tmp/graph15428402043541014458.bin' '-w' '/tmp/graph15428402043541014458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15428402043541014458.bin' '-l' '-1' '-v' '-w' '/tmp/graph15428402043541014458.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:48:52] [INFO ] Decomposing Gal with order
[2025-06-03 16:48:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:48:52] [INFO ] Removed a total of 799 redundant transitions.
[2025-06-03 16:48:52] [INFO ] Flatten gal took : 54 ms
[2025-06-03 16:48:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 15 ms.
[2025-06-03 16:48:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality3285936511403365482.gal : 5 ms
[2025-06-03 16:48:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality16148574142825119786.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/CTLCardinality3285936511403365482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16148574142825119786.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 474 transition count 771
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 421 transition count 771
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 106 place count 421 transition count 723
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 202 place count 373 transition count 723
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 294 place count 327 transition count 677
Applied a total of 294 rules in 33 ms. Remains 327 /476 variables (removed 149) and now considering 677/824 (removed 147) transitions.
Running 675 sub problems to find dead transitions.
[2025-06-03 16:49:22] [INFO ] Flow matrix only has 665 transitions (discarded 12 similar events)
// Phase 1: matrix 665 rows 327 cols
[2025-06-03 16:49:22] [INFO ] Computed 44 invariants in 12 ms
[2025-06-03 16:49:22] [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/325 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:27] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:27] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:27] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:27] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:27] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:27] [INFO ] Deduced a trap composed of 40 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 16:49:27] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:28] [INFO ] Deduced a trap composed of 43 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 16:49:28] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:29] [INFO ] Deduced a trap composed of 116 places in 169 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:29] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:29] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:31] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:33] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:34] [INFO ] Deduced a trap composed of 116 places in 177 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:40] [INFO ] Deduced a trap composed of 110 places in 170 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:41] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 325/992 variables, and 59 constraints, problems are : Problem set: 0 solved, 675 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/327 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 675 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:49:55] [INFO ] Deduced a trap composed of 180 places in 173 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:50:02] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 38 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/992 variables, and 61 constraints, problems are : Problem set: 0 solved, 675 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/327 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/675 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40346ms problems are : Problem set: 0 solved, 675 unsolved
Search for dead transitions found 0 dead transitions in 40347ms
[2025-06-03 16:50:03] [INFO ] Flow matrix only has 665 transitions (discarded 12 similar events)
[2025-06-03 16:50:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:50:04] [INFO ] Implicit Places using invariants in 882 ms returned [82, 166, 189, 191, 289, 301]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 885 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 321/476 places, 677/824 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 317 transition count 673
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 317 transition count 673
Applied a total of 8 rules in 21 ms. Remains 317 /321 variables (removed 4) and now considering 673/677 (removed 4) transitions.
[2025-06-03 16:50:04] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
// Phase 1: matrix 661 rows 317 cols
[2025-06-03 16:50:04] [INFO ] Computed 38 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:50:04] [INFO ] Implicit Places using invariants in 786 ms returned []
[2025-06-03 16:50:04] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
[2025-06-03 16:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:50:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 16:50:10] [INFO ] Implicit Places using invariants and state equation in 5805 ms returned []
Implicit Place search using SMT with State Equation took 6593 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 317/476 places, 673/824 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 47882 ms. Remains : 317/476 places, 673/824 transitions.
[2025-06-03 16:50:10] [INFO ] Flatten gal took : 22 ms
[2025-06-03 16:50:10] [INFO ] Flatten gal took : 19 ms
[2025-06-03 16:50:10] [INFO ] Input system was already deterministic with 673 transitions.
[2025-06-03 16:50:10] [INFO ] Flatten gal took : 19 ms
[2025-06-03 16:50:10] [INFO ] Flatten gal took : 18 ms
[2025-06-03 16:50:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality5342257977619662225.gal : 3 ms
[2025-06-03 16:50:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality10296107448644060668.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/CTLCardinality5342257977619662225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10296107448644060668.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.37841e+06,29.4063,938560,2,162870,5,1.20603e+06,6,0,2013,1.2748e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 16:50:40] [INFO ] Flatten gal took : 19 ms
[2025-06-03 16:50:40] [INFO ] Applying decomposition
[2025-06-03 16:50:41] [INFO ] Flatten gal took : 19 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/graph4063720032471558322.txt' '-o' '/tmp/graph4063720032471558322.bin' '-w' '/tmp/graph4063720032471558322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4063720032471558322.bin' '-l' '-1' '-v' '-w' '/tmp/graph4063720032471558322.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:50:41] [INFO ] Decomposing Gal with order
[2025-06-03 16:50:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:50:41] [INFO ] Removed a total of 403 redundant transitions.
[2025-06-03 16:50:41] [INFO ] Flatten gal took : 40 ms
[2025-06-03 16:50:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 4 ms.
[2025-06-03 16:50:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality7228005019400234599.gal : 5 ms
[2025-06-03 16:50:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality17330973699470171309.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/CTLCardinality7228005019400234599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17330973699470171309.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 462 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 462 transition count 812
Applied a total of 26 rules in 16 ms. Remains 462 /476 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:51:11] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 462 cols
[2025-06-03 16:51:11] [INFO ] Computed 44 invariants in 15 ms
[2025-06-03 16:51:11] [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/460 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 25/42 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 16:51:19] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:19] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:20] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:20] [INFO ] Deduced a trap composed of 63 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 16:51:20] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:20] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:20] [INFO ] Deduced a trap composed of 121 places in 227 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:21] [INFO ] Deduced a trap composed of 205 places in 223 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:21] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:21] [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 16:51:22] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:23] [INFO ] Deduced a trap composed of 205 places in 238 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:24] [INFO ] Deduced a trap composed of 217 places in 246 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:25] [INFO ] Deduced a trap composed of 298 places in 243 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:25] [INFO ] Deduced a trap composed of 217 places in 240 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:51:26] [INFO ] Deduced a trap composed of 222 places in 231 ms of which 70 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1262 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 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/460 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1262 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40406ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40407ms
[2025-06-03 16:51:51] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:51:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:51:52] [INFO ] Implicit Places using invariants in 1138 ms returned [112, 235, 271, 410, 422]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1140 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/476 places, 812/824 transitions.
Applied a total of 0 rules in 7 ms. Remains 457 /457 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41572 ms. Remains : 457/476 places, 812/824 transitions.
[2025-06-03 16:51:52] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:51:52] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:51:52] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 16:51:52] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:51:52] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:51:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality3712796999172686755.gal : 3 ms
[2025-06-03 16:51:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3850105246200483376.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/CTLCardinality3712796999172686755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3850105246200483376.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 16:52:23] [INFO ] Flatten gal took : 28 ms
[2025-06-03 16:52:23] [INFO ] Applying decomposition
[2025-06-03 16:52:23] [INFO ] Flatten gal took : 21 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/graph897806472266092909.txt' '-o' '/tmp/graph897806472266092909.bin' '-w' '/tmp/graph897806472266092909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph897806472266092909.bin' '-l' '-1' '-v' '-w' '/tmp/graph897806472266092909.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:52:23] [INFO ] Decomposing Gal with order
[2025-06-03 16:52:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:52:23] [INFO ] Removed a total of 596 redundant transitions.
[2025-06-03 16:52:23] [INFO ] Flatten gal took : 43 ms
[2025-06-03 16:52:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3 ms.
[2025-06-03 16:52:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality7476018614264999615.gal : 4 ms
[2025-06-03 16:52:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality13253391190937093820.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/CTLCardinality7476018614264999615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13253391190937093820.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 462 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 462 transition count 812
Applied a total of 26 rules in 14 ms. Remains 462 /476 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 16:52:53] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:52:53] [INFO ] Invariant cache hit.
[2025-06-03 16:52:53] [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/460 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 25/42 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 16:53:01] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:02] [INFO ] Deduced a trap composed of 63 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 16:53:02] [INFO ] Deduced a trap composed of 63 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 16:53:02] [INFO ] Deduced a trap composed of 63 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 16:53:02] [INFO ] Deduced a trap composed of 63 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 16:53:02] [INFO ] Deduced a trap composed of 63 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 16:53:02] [INFO ] Deduced a trap composed of 121 places in 204 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:03] [INFO ] Deduced a trap composed of 205 places in 239 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:03] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:03] [INFO ] Deduced a trap composed of 222 places in 240 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:04] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:06] [INFO ] Deduced a trap composed of 217 places in 221 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:07] [INFO ] Deduced a trap composed of 205 places in 237 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:07] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:07] [INFO ] Deduced a trap composed of 217 places in 240 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:08] [INFO ] Deduced a trap composed of 222 places in 237 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:53:11] [INFO ] Deduced a trap composed of 298 places in 251 ms of which 86 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1262 variables, and 59 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 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/460 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1262 variables, and 59 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40393ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40394ms
[2025-06-03 16:53:33] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 16:53:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:34] [INFO ] Implicit Places using invariants in 838 ms returned [112, 235, 271, 274, 410, 422]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 839 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/476 places, 812/824 transitions.
Applied a total of 0 rules in 7 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41256 ms. Remains : 456/476 places, 812/824 transitions.
[2025-06-03 16:53:34] [INFO ] Flatten gal took : 39 ms
[2025-06-03 16:53:34] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:53:34] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-03 16:53:34] [INFO ] Flatten gal took : 22 ms
[2025-06-03 16:53:34] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:53:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9935917101628262610.gal : 3 ms
[2025-06-03 16:53:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality12181539915632148105.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/CTLCardinality9935917101628262610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12181539915632148105.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 16:54:04] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:54:04] [INFO ] Applying decomposition
[2025-06-03 16:54:04] [INFO ] Flatten gal took : 21 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/graph17381680718692201870.txt' '-o' '/tmp/graph17381680718692201870.bin' '-w' '/tmp/graph17381680718692201870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17381680718692201870.bin' '-l' '-1' '-v' '-w' '/tmp/graph17381680718692201870.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:54:04] [INFO ] Decomposing Gal with order
[2025-06-03 16:54:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:54:04] [INFO ] Removed a total of 576 redundant transitions.
[2025-06-03 16:54:04] [INFO ] Flatten gal took : 41 ms
[2025-06-03 16:54:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 212 labels/synchronizations in 9 ms.
[2025-06-03 16:54:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality13918796530129488378.gal : 6 ms
[2025-06-03 16:54:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality1550087056209409022.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/CTLCardinality13918796530129488378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1550087056209409022.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 463 transition count 813
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 463 transition count 813
Applied a total of 24 rules in 14 ms. Remains 463 /476 variables (removed 13) and now considering 813/824 (removed 11) transitions.
Running 811 sub problems to find dead transitions.
[2025-06-03 16:54:35] [INFO ] Flow matrix only has 801 transitions (discarded 12 similar events)
// Phase 1: matrix 801 rows 463 cols
[2025-06-03 16:54:35] [INFO ] Computed 44 invariants in 17 ms
[2025-06-03 16:54:35] [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/461 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:41] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:41] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:41] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:42] [INFO ] Deduced a trap composed of 64 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 16:54:42] [INFO ] Deduced a trap composed of 63 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 16:54:42] [INFO ] Deduced a trap composed of 63 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 16:54:42] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:43] [INFO ] Deduced a trap composed of 122 places in 174 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:43] [INFO ] Deduced a trap composed of 211 places in 248 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:43] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:43] [INFO ] Deduced a trap composed of 210 places in 239 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:44] [INFO ] Deduced a trap composed of 223 places in 235 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:45] [INFO ] Deduced a trap composed of 218 places in 219 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:47] [INFO ] Deduced a trap composed of 189 places in 203 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:47] [INFO ] Deduced a trap composed of 222 places in 239 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:48] [INFO ] Deduced a trap composed of 228 places in 234 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:49] [INFO ] Deduced a trap composed of 288 places in 226 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 16:54:52] [INFO ] Deduced a trap composed of 87 places in 204 ms of which 48 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/1264 variables, and 59 constraints, problems are : Problem set: 0 solved, 811 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/463 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 811/811 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/1264 variables, and 59 constraints, problems are : Problem set: 0 solved, 811 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/463 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/811 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40397ms problems are : Problem set: 0 solved, 811 unsolved
Search for dead transitions found 0 dead transitions in 40399ms
[2025-06-03 16:55:15] [INFO ] Flow matrix only has 801 transitions (discarded 12 similar events)
[2025-06-03 16:55:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:55:16] [INFO ] Implicit Places using invariants in 792 ms returned [112, 236, 272, 275, 411, 423]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 794 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/476 places, 813/824 transitions.
Applied a total of 0 rules in 9 ms. Remains 457 /457 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41217 ms. Remains : 457/476 places, 813/824 transitions.
[2025-06-03 16:55:16] [INFO ] Flatten gal took : 20 ms
[2025-06-03 16:55:16] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:55:16] [INFO ] Input system was already deterministic with 813 transitions.
[2025-06-03 16:55:16] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:55:16] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:55:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality12910311702528607943.gal : 4 ms
[2025-06-03 16:55:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality8557113171159234971.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/CTLCardinality12910311702528607943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8557113171159234971.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 16:55:46] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:55:46] [INFO ] Applying decomposition
[2025-06-03 16:55:46] [INFO ] Flatten gal took : 31 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/graph16008536434673519081.txt' '-o' '/tmp/graph16008536434673519081.bin' '-w' '/tmp/graph16008536434673519081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16008536434673519081.bin' '-l' '-1' '-v' '-w' '/tmp/graph16008536434673519081.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:55:46] [INFO ] Decomposing Gal with order
[2025-06-03 16:55:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:55:46] [INFO ] Removed a total of 547 redundant transitions.
[2025-06-03 16:55:46] [INFO ] Flatten gal took : 37 ms
[2025-06-03 16:55:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 3 ms.
[2025-06-03 16:55:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality9625302092092878439.gal : 4 ms
[2025-06-03 16:55:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality8184404095524196986.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/CTLCardinality9625302092092878439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8184404095524196986.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 16:56:16] [INFO ] Flatten gal took : 26 ms
[2025-06-03 16:56:16] [INFO ] Flatten gal took : 21 ms
[2025-06-03 16:56:16] [INFO ] Applying decomposition
[2025-06-03 16:56:16] [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/graph9058021656411900461.txt' '-o' '/tmp/graph9058021656411900461.bin' '-w' '/tmp/graph9058021656411900461.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9058021656411900461.bin' '-l' '-1' '-v' '-w' '/tmp/graph9058021656411900461.weights' '-q' '0' '-e' '0.001'
[2025-06-03 16:56:16] [INFO ] Decomposing Gal with order
[2025-06-03 16:56:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 16:56:16] [INFO ] Removed a total of 1345 redundant transitions.
[2025-06-03 16:56:16] [INFO ] Flatten gal took : 51 ms
[2025-06-03 16:56:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 558 labels/synchronizations in 27 ms.
[2025-06-03 16:56:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality6051707483240075966.gal : 5 ms
[2025-06-03 16:56:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5732817734043651990.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/CTLCardinality6051707483240075966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5732817734043651990.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40755e+08,55.0518,1555492,2,238501,5,2.87482e+06,6,0,2850,3.0932e+06,0


Converting to forward existential form...Done !
original formula: ((AF(AX(AG(((((gi8.gu12.P_2318_6+gi8.gu12.P_2318_2)+(gi8.gu12.P_2318_1+gi8.gu12.P_2318_3))+(gi8.gu12.P_2318_4+gi8.gu12.P_2318_5))<4)))) *...1490
=> equivalent forward existential formula: ([(FwdU((Init * !((!(EG(!(!(EX(!(!(E(TRUE U !(((((gi8.gu12.P_2318_6+gi8.gu12.P_2318_2)+(gi8.gu12.P_2318_1+gi8.gu...2117
Reverse transition relation is NOT exact ! Due to transitions gi1.t792, gi1.t785, gi1.t692, gi1.t212, gi1.t66, gi1.t17, gi5.gu30.t225, gi9.gu13.t50, gi9.gu...918
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-03 17:23:26] [INFO ] Flatten gal took : 131 ms
[2025-06-03 17:23:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2084417691452478114.gal : 29 ms
[2025-06-03 17:23:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality18290005354920116313.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2084417691452478114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18290005354920116313.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40755e+08,88.3649,2194736,2,302243,5,3.73322e+06,6,0,2800,4.44856e+06,0


Converting to forward existential form...Done !

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-PT-S02J04T06"
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-PT-S02J04T06, 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-174881254000409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 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 ;