Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200273.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 MedleyA-PT-23, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200273
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 150K 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 MedleyA-PT-23-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-23-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748898530470

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 21:08:52] [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-02 21:08:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:08:53] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2025-06-02 21:08:53] [INFO ] Transformed 378 places.
[2025-06-02 21:08:53] [INFO ] Transformed 614 transitions.
[2025-06-02 21:08:53] [INFO ] Found NUPN structural information;
[2025-06-02 21:08:53] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
FORMULA MedleyA-PT-23-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 114 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 70 place count 308 transition count 547
Iterating global reduction 1 with 67 rules applied. Total rules applied 137 place count 308 transition count 547
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 173 place count 272 transition count 511
Iterating global reduction 1 with 36 rules applied. Total rules applied 209 place count 272 transition count 511
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 220 place count 261 transition count 494
Iterating global reduction 1 with 11 rules applied. Total rules applied 231 place count 261 transition count 494
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 234 place count 258 transition count 485
Iterating global reduction 1 with 3 rules applied. Total rules applied 237 place count 258 transition count 485
Applied a total of 237 rules in 131 ms. Remains 258 /378 variables (removed 120) and now considering 485/614 (removed 129) transitions.
// Phase 1: matrix 485 rows 258 cols
[2025-06-02 21:08:53] [INFO ] Computed 8 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:08:54] [INFO ] Implicit Places using invariants in 597 ms returned []
[2025-06-02 21:08:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:08:54] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
Running 484 sub problems to find dead transitions.
[2025-06-02 21:08:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (OVERLAPS) 1/258 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:07] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (OVERLAPS) 485/743 variables, 258/267 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:20] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/743 variables, and 268 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 484/484 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 484 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (OVERLAPS) 1/258 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (OVERLAPS) 485/743 variables, 258/268 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 484/752 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:44] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:44] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:50] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/743 variables, and 755 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 484/484 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60755ms problems are : Problem set: 0 solved, 484 unsolved
Search for dead transitions found 0 dead transitions in 60889ms
Starting structural reductions in LTL mode, iteration 1 : 258/378 places, 485/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62413 ms. Remains : 258/378 places, 485/614 transitions.
Support contains 114 out of 258 places after structural reductions.
[2025-06-02 21:09:56] [INFO ] Flatten gal took : 100 ms
[2025-06-02 21:09:56] [INFO ] Flatten gal took : 50 ms
[2025-06-02 21:09:56] [INFO ] Input system was already deterministic with 485 transitions.
Support contains 110 out of 258 places (down from 114) after GAL structural reductions.
RANDOM walk for 40000 steps (50 resets) in 3739 ms. (10 steps per ms) remains 28/66 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (17 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (15 resets) in 26 ms. (148 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (16 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (11 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 22/24 properties
[2025-06-02 21:09:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 37/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 27/104 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 347/451 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 236/687 variables, 117/229 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/687 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 48/735 variables, 30/259 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 8/743 variables, 7/266 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/743 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 0/743 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 743/743 variables, and 266 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2893 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 37/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 27/104 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 347/451 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 236/687 variables, 117/231 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/687 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:10:02] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:10:02] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/687 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/687 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 48/735 variables, 30/283 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/735 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 14 (OVERLAPS) 8/743 variables, 7/290 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/743 variables, and 290 constraints, problems are : Problem set: 1 solved, 21 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7915ms problems are : Problem set: 1 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 485/485 transitions.
Graph (trivial) has 170 edges and 258 vertex of which 27 / 258 are part of one of the 3 SCC in 4 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 234 transition count 426
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 43 place count 215 transition count 422
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 213 transition count 422
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 45 place count 213 transition count 414
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 61 place count 205 transition count 414
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 84 place count 182 transition count 385
Iterating global reduction 3 with 23 rules applied. Total rules applied 107 place count 182 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 182 transition count 383
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 109 place count 182 transition count 378
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 119 place count 177 transition count 378
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 122 place count 177 transition count 375
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 124 place count 175 transition count 369
Iterating global reduction 5 with 2 rules applied. Total rules applied 126 place count 175 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 127 place count 175 transition count 368
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 169 place count 154 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 170 place count 154 transition count 346
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 177 place count 147 transition count 325
Iterating global reduction 7 with 7 rules applied. Total rules applied 184 place count 147 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 185 place count 147 transition count 324
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 203 place count 138 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 207 place count 138 transition count 333
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 208 place count 137 transition count 330
Iterating global reduction 8 with 1 rules applied. Total rules applied 209 place count 137 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 210 place count 137 transition count 329
Free-agglomeration rule applied 30 times.
Iterating global reduction 9 with 30 rules applied. Total rules applied 240 place count 137 transition count 299
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 36 rules applied. Total rules applied 276 place count 107 transition count 293
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 282 place count 104 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 285 place count 104 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 286 place count 104 transition count 288
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 290 place count 103 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 291 place count 102 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 292 place count 101 transition count 284
Applied a total of 292 rules in 297 ms. Remains 101 /258 variables (removed 157) and now considering 284/485 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 101/258 places, 284/485 transitions.
RANDOM walk for 36501 steps (494 resets) in 1353 ms. (26 steps per ms) remains 0/21 properties
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2025-06-02 21:10:06] [INFO ] Flatten gal took : 50 ms
[2025-06-02 21:10:06] [INFO ] Flatten gal took : 53 ms
[2025-06-02 21:10:06] [INFO ] Input system was already deterministic with 485 transitions.
Computed a total of 21 stabilizing places and 26 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Graph (trivial) has 207 edges and 258 vertex of which 27 / 258 are part of one of the 3 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 233 transition count 409
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 87 place count 192 transition count 405
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 90 place count 190 transition count 404
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 90 place count 190 transition count 398
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 102 place count 184 transition count 398
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 140 place count 146 transition count 352
Iterating global reduction 3 with 38 rules applied. Total rules applied 178 place count 146 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 180 place count 146 transition count 350
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 180 place count 146 transition count 347
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 186 place count 143 transition count 347
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 199 place count 130 transition count 308
Iterating global reduction 4 with 13 rules applied. Total rules applied 212 place count 130 transition count 308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 217 place count 130 transition count 303
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 218 place count 129 transition count 301
Iterating global reduction 5 with 1 rules applied. Total rules applied 219 place count 129 transition count 301
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 220 place count 128 transition count 298
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 128 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 128 transition count 297
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 260 place count 109 transition count 278
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 267 place count 102 transition count 257
Iterating global reduction 6 with 7 rules applied. Total rules applied 274 place count 102 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 275 place count 102 transition count 256
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 276 place count 101 transition count 254
Iterating global reduction 7 with 1 rules applied. Total rules applied 277 place count 101 transition count 254
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 278 place count 100 transition count 251
Iterating global reduction 7 with 1 rules applied. Total rules applied 279 place count 100 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 280 place count 100 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 286 place count 100 transition count 244
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 292 place count 97 transition count 241
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 294 place count 95 transition count 235
Iterating global reduction 8 with 2 rules applied. Total rules applied 296 place count 95 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 298 place count 95 transition count 233
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 300 place count 93 transition count 231
Applied a total of 300 rules in 134 ms. Remains 93 /258 variables (removed 165) and now considering 231/485 (removed 254) transitions.
[2025-06-02 21:10:06] [INFO ] Flow matrix only has 222 transitions (discarded 9 similar events)
// Phase 1: matrix 222 rows 93 cols
[2025-06-02 21:10:06] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:10:06] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-02 21:10:06] [INFO ] Flow matrix only has 222 transitions (discarded 9 similar events)
[2025-06-02 21:10:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:10:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 21:10:07] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:10:07] [INFO ] Redundant transitions in 18 ms returned []
Running 201 sub problems to find dead transitions.
[2025-06-02 21:10:07] [INFO ] Flow matrix only has 222 transitions (discarded 9 similar events)
[2025-06-02 21:10:07] [INFO ] Invariant cache hit.
[2025-06-02 21:10:07] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 221/311 variables, 90/98 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:10:14] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:10:18] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 3/314 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/315 variables, and 105 constraints, problems are : Problem set: 0 solved, 201 unsolved in 23168 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 221/311 variables, 90/98 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 27/127 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 3/314 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 174/306 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (OVERLAPS) 0/314 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/315 variables, and 306 constraints, problems are : Problem set: 0 solved, 201 unsolved in 22236 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45556ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 45558ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/258 places, 231/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46171 ms. Remains : 93/258 places, 231/485 transitions.
[2025-06-02 21:10:52] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:10:52] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:10:52] [INFO ] Input system was already deterministic with 231 transitions.
[2025-06-02 21:10:52] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:10:52] [INFO ] Flatten gal took : 15 ms
[2025-06-02 21:10:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality12598034875115340941.gal : 9 ms
[2025-06-02 21:10:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality5228259650480582039.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/CTLCardinality12598034875115340941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5228259650480582039.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,3.77161e+07,13.0826,264956,2,10879,5,684439,6,0,599,984482,0


Converting to forward existential form...Done !
original formula: (EF((((((p140==1)||(p315==1))||(p370==0))&&(p241==0))&&(p79==1))) * A((p12==1) U ((!(((p205==0) * EG(((p56==0)||(p238==1))))) + (p222==0)...171
=> equivalent forward existential formula: [(((Init * E(TRUE U (((((p140==1)||(p315==1))||(p370==0))&&(p241==0))&&(p79==1)))) * !(EG(!(((!(((p205==0) * EG(...394
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t14, t21, t23, t25, t26, t33, t34, t38, t41, t42, t47, t53, t54, t57, t87, t88, t89, ...515
Detected timeout of ITS tools.
[2025-06-02 21:11:23] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:11:23] [INFO ] Applying decomposition
[2025-06-02 21:11:23] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9725761318896383912.txt' '-o' '/tmp/graph9725761318896383912.bin' '-w' '/tmp/graph9725761318896383912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9725761318896383912.bin' '-l' '-1' '-v' '-w' '/tmp/graph9725761318896383912.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:11:23] [INFO ] Decomposing Gal with order
[2025-06-02 21:11:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:11:23] [INFO ] Removed a total of 380 redundant transitions.
[2025-06-02 21:11:23] [INFO ] Flatten gal took : 94 ms
[2025-06-02 21:11:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 19 ms.
[2025-06-02 21:11:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality3466961610389976659.gal : 8 ms
[2025-06-02 21:11:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality12911410196454746195.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/CTLCardinality3466961610389976659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12911410196454746195.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.77161e+07,0.215203,9628,359,110,9471,988,462,20512,127,2239,0


Converting to forward existential form...Done !
original formula: (EF((((((i4.u12.p140==1)||(i5.u15.p315==1))||(i8.u22.p370==0))&&(i5.u17.p241==0))&&(i3.i1.u8.p79==1))) * A((i0.u0.p12==1) U ((!(((i4.u12....253
=> equivalent forward existential formula: [(((Init * E(TRUE U (((((i4.u12.p140==1)||(i5.u15.p315==1))||(i8.u22.p370==0))&&(i5.u17.p241==0))&&(i3.i1.u8.p79...554
Reverse transition relation is NOT exact ! Due to transitions t87, t88, t89, t90, t91, t92, t102, t103, t104, t123, t124, t125, t126, t127, t128, t132, t13...578
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,29.8062,626952,1,0,813631,67880,2774,3.06648e+06,683,566290,1270059
FORMULA MedleyA-PT-23-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 211 transition count 430
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 211 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 211 transition count 429
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 119 place count 187 transition count 403
Iterating global reduction 1 with 24 rules applied. Total rules applied 143 place count 187 transition count 403
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 157 place count 173 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 171 place count 173 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 173 place count 173 transition count 366
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 179 place count 167 transition count 352
Iterating global reduction 2 with 6 rules applied. Total rules applied 185 place count 167 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 187 place count 167 transition count 350
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 190 place count 164 transition count 342
Iterating global reduction 3 with 3 rules applied. Total rules applied 193 place count 164 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 196 place count 164 transition count 339
Applied a total of 196 rules in 21 ms. Remains 164 /258 variables (removed 94) and now considering 339/485 (removed 146) transitions.
// Phase 1: matrix 339 rows 164 cols
[2025-06-02 21:11:53] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:11:53] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-02 21:11:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:11:54] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2025-06-02 21:11:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 339/503 variables, 164/172 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:06] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:15] [INFO ] Deduced a trap along path composed of 3 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-02 21:12:15] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:16] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/503 variables, and 176 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 339/503 variables, 164/173 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 338/511 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:28] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:29] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:38] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:38] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 338 unsolved
SMT process timed out in 60115ms, After SMT, problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LTL mode, iteration 1 : 164/258 places, 339/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60780 ms. Remains : 164/258 places, 339/485 transitions.
[2025-06-02 21:12:54] [INFO ] Flatten gal took : 25 ms
[2025-06-02 21:12:54] [INFO ] Flatten gal took : 27 ms
[2025-06-02 21:12:54] [INFO ] Input system was already deterministic with 339 transitions.
[2025-06-02 21:12:54] [INFO ] Flatten gal took : 25 ms
[2025-06-02 21:12:54] [INFO ] Flatten gal took : 25 ms
[2025-06-02 21:12:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality7297040310972946084.gal : 9 ms
[2025-06-02 21:12:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality12528209845060105216.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/CTLCardinality7297040310972946084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12528209845060105216.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-02 21:13:24] [INFO ] Flatten gal took : 15 ms
[2025-06-02 21:13:24] [INFO ] Applying decomposition
[2025-06-02 21:13:24] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14211717780580342939.txt' '-o' '/tmp/graph14211717780580342939.bin' '-w' '/tmp/graph14211717780580342939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14211717780580342939.bin' '-l' '-1' '-v' '-w' '/tmp/graph14211717780580342939.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:13:24] [INFO ] Decomposing Gal with order
[2025-06-02 21:13:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:13:24] [INFO ] Removed a total of 499 redundant transitions.
[2025-06-02 21:13:24] [INFO ] Flatten gal took : 39 ms
[2025-06-02 21:13:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 10 ms.
[2025-06-02 21:13:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality818560803729750899.gal : 6 ms
[2025-06-02 21:13:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4473401940224898814.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/CTLCardinality818560803729750899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4473401940224898814.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.20317e+10,5.16237,108380,1620,54,185004,855,674,364060,87,2728,0


Converting to forward existential form...Done !
original formula: (AF(EX((((!(A((i5.u34.p272==1) U (i2.u8.p39==1))) + ((i5.u33.p264==0)&&(i5.u31.p255==1))) * (i9.i1.u51.p374==0)) * (i2.u14.p89==0)))) * A...175
=> equivalent forward existential formula: ([FwdG(Init,!(EX((((!(!((E(!((i2.u8.p39==1)) U (!((i5.u34.p272==1)) * !((i2.u8.p39==1)))) + EG(!((i2.u8.p39==1))...306
(forward)formula 0,0,5.18756,108508,1,0,185004,855,681,364060,92,2728,603
FORMULA MedleyA-PT-23-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 207 transition count 426
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 207 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 207 transition count 425
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 131 place count 179 transition count 395
Iterating global reduction 1 with 28 rules applied. Total rules applied 159 place count 179 transition count 395
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 178 place count 160 transition count 348
Iterating global reduction 1 with 19 rules applied. Total rules applied 197 place count 160 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 199 place count 160 transition count 346
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 208 place count 151 transition count 324
Iterating global reduction 2 with 9 rules applied. Total rules applied 217 place count 151 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 222 place count 151 transition count 319
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 226 place count 147 transition count 309
Iterating global reduction 3 with 4 rules applied. Total rules applied 230 place count 147 transition count 309
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 234 place count 147 transition count 305
Applied a total of 234 rules in 18 ms. Remains 147 /258 variables (removed 111) and now considering 305/485 (removed 180) transitions.
// Phase 1: matrix 305 rows 147 cols
[2025-06-02 21:13:29] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:13:29] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 21:13:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:13:30] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-02 21:13:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 305/452 variables, 147/155 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:39] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:47] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:47] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:47] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/452 variables, and 159 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/452 variables, 147/156 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 304/460 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 3/463 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:14:18] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:14:18] [INFO ] Deduced a trap along path composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 465 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 147/258 places, 305/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 147/258 places, 305/485 transitions.
[2025-06-02 21:14:30] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:14:30] [INFO ] Flatten gal took : 10 ms
[2025-06-02 21:14:30] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-02 21:14:30] [INFO ] Flatten gal took : 9 ms
[2025-06-02 21:14:30] [INFO ] Flatten gal took : 9 ms
[2025-06-02 21:14:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality17251634816720831478.gal : 3 ms
[2025-06-02 21:14:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality14556767886459841970.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/CTLCardinality17251634816720831478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14556767886459841970.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-02 21:15:00] [INFO ] Flatten gal took : 10 ms
[2025-06-02 21:15:00] [INFO ] Applying decomposition
[2025-06-02 21:15:00] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1201868651136132998.txt' '-o' '/tmp/graph1201868651136132998.bin' '-w' '/tmp/graph1201868651136132998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1201868651136132998.bin' '-l' '-1' '-v' '-w' '/tmp/graph1201868651136132998.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:15:00] [INFO ] Decomposing Gal with order
[2025-06-02 21:15:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:15:00] [INFO ] Removed a total of 443 redundant transitions.
[2025-06-02 21:15:00] [INFO ] Flatten gal took : 27 ms
[2025-06-02 21:15:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 6 ms.
[2025-06-02 21:15:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality14621698307211145368.gal : 4 ms
[2025-06-02 21:15:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality1613346906532982696.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/CTLCardinality14621698307211145368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1613346906532982696.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.8027e+09,6.42759,121748,1408,44,201537,608,554,398057,63,1711,0


Converting to forward existential form...Done !
original formula: EX(EF(AG((i5.u31.p271==0))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !((i5.u31.p271==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t132, t134, t135, t168, t170, t171, t192, t194, t195, t200, t201, t202, t204, t205,...847
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Graph (trivial) has 222 edges and 258 vertex of which 28 / 258 are part of one of the 3 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 232 transition count 403
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 187 transition count 400
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 94 place count 187 transition count 395
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 182 transition count 395
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 148 place count 138 transition count 341
Iterating global reduction 2 with 44 rules applied. Total rules applied 192 place count 138 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 194 place count 138 transition count 339
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 194 place count 138 transition count 334
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 204 place count 133 transition count 334
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 223 place count 114 transition count 278
Iterating global reduction 3 with 19 rules applied. Total rules applied 242 place count 114 transition count 278
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 250 place count 114 transition count 270
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 252 place count 112 transition count 265
Iterating global reduction 4 with 2 rules applied. Total rules applied 254 place count 112 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 112 transition count 264
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 111 transition count 261
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 111 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 111 transition count 260
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 294 place count 93 transition count 242
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 301 place count 86 transition count 221
Iterating global reduction 6 with 7 rules applied. Total rules applied 308 place count 86 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 309 place count 86 transition count 220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 310 place count 85 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 311 place count 85 transition count 218
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 312 place count 84 transition count 215
Iterating global reduction 7 with 1 rules applied. Total rules applied 313 place count 84 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 314 place count 84 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 320 place count 84 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 326 place count 81 transition count 205
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 329 place count 78 transition count 196
Iterating global reduction 8 with 3 rules applied. Total rules applied 332 place count 78 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 335 place count 78 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 337 place count 76 transition count 191
Applied a total of 337 rules in 104 ms. Remains 76 /258 variables (removed 182) and now considering 191/485 (removed 294) transitions.
[2025-06-02 21:15:30] [INFO ] Flow matrix only has 182 transitions (discarded 9 similar events)
// Phase 1: matrix 182 rows 76 cols
[2025-06-02 21:15:30] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:15:30] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 21:15:30] [INFO ] Flow matrix only has 182 transitions (discarded 9 similar events)
[2025-06-02 21:15:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:15:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:15:31] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:15:31] [INFO ] Redundant transitions in 8 ms returned []
Running 166 sub problems to find dead transitions.
[2025-06-02 21:15:31] [INFO ] Flow matrix only has 182 transitions (discarded 9 similar events)
[2025-06-02 21:15:31] [INFO ] Invariant cache hit.
[2025-06-02 21:15:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 181/254 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:15:34] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:15:36] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 3/257 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/258 variables, and 87 constraints, problems are : Problem set: 0 solved, 166 unsolved in 12027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 181/254 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 23/105 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 3/257 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 143/253 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/258 variables, and 253 constraints, problems are : Problem set: 0 solved, 166 unsolved in 12412 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 24482ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 24484ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/258 places, 191/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24924 ms. Remains : 76/258 places, 191/485 transitions.
[2025-06-02 21:15:55] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:15:55] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:15:55] [INFO ] Input system was already deterministic with 191 transitions.
[2025-06-02 21:15:55] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:15:55] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:15:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality13070138510662878526.gal : 2 ms
[2025-06-02 21:15:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality8855263517871328248.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/CTLCardinality13070138510662878526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8855263517871328248.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,1.11169e+07,4.75725,98076,2,8065,5,270940,6,0,491,371682,0


Converting to forward existential form...Done !
original formula: EF(EG((p359==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p359==1))] != FALSE
Hit Full ! (commute/partial/dont) 188/0/3
(forward)formula 0,1,7.01426,98332,1,0,8,478575,19,2,2871,371682,8
FORMULA MedleyA-PT-23-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 216 transition count 439
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 216 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 216 transition count 438
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 107 place count 194 transition count 416
Iterating global reduction 1 with 22 rules applied. Total rules applied 129 place count 194 transition count 416
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 141 place count 182 transition count 385
Iterating global reduction 1 with 12 rules applied. Total rules applied 153 place count 182 transition count 385
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 155 place count 180 transition count 379
Iterating global reduction 1 with 2 rules applied. Total rules applied 157 place count 180 transition count 379
Applied a total of 157 rules in 17 ms. Remains 180 /258 variables (removed 78) and now considering 379/485 (removed 106) transitions.
// Phase 1: matrix 379 rows 180 cols
[2025-06-02 21:16:02] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:16:03] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-06-02 21:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:16:03] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2025-06-02 21:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (OVERLAPS) 379/559 variables, 180/188 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:17] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:24] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:25] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:27] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/559 variables, and 192 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/559 variables, 180/189 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 378/567 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:40] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:40] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:52] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 378 unsolved
SMT process timed out in 60139ms, After SMT, problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 180/258 places, 379/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60733 ms. Remains : 180/258 places, 379/485 transitions.
[2025-06-02 21:17:03] [INFO ] Flatten gal took : 15 ms
[2025-06-02 21:17:03] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:17:03] [INFO ] Input system was already deterministic with 379 transitions.
[2025-06-02 21:17:03] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:17:03] [INFO ] Flatten gal took : 15 ms
[2025-06-02 21:17:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality42193671474887784.gal : 5 ms
[2025-06-02 21:17:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality3250413654536834529.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/CTLCardinality42193671474887784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3250413654536834529.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 21:17:33] [INFO ] Flatten gal took : 14 ms
[2025-06-02 21:17:33] [INFO ] Applying decomposition
[2025-06-02 21:17:33] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15304467612217476067.txt' '-o' '/tmp/graph15304467612217476067.bin' '-w' '/tmp/graph15304467612217476067.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15304467612217476067.bin' '-l' '-1' '-v' '-w' '/tmp/graph15304467612217476067.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:17:33] [INFO ] Decomposing Gal with order
[2025-06-02 21:17:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:17:33] [INFO ] Removed a total of 545 redundant transitions.
[2025-06-02 21:17:33] [INFO ] Flatten gal took : 63 ms
[2025-06-02 21:17:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 21 ms.
[2025-06-02 21:17:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality14306776098219549258.gal : 9 ms
[2025-06-02 21:17:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality16164203284003582741.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14306776098219549258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16164203284003582741.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83878e+10,19.4571,343260,2872,119,540614,1985,798,1.2269e+06,110,8004,0


Converting to forward existential form...Done !
original formula: (EX(E(!(((EX(((i7.u33.p257==0)||(i2.i0.u11.p56==1))) + !(((i2.i0.u14.p71==0)||(i7.u39.p301==1)))) + (i2.i0.u7.p86!=1))) U EF(!(((i7.u34.p...601
=> equivalent forward existential formula: [(((Init * EX(E(!(((EX(((i7.u33.p257==0)||(i2.i0.u11.p56==1))) + !(((i2.i0.u14.p71==0)||(i7.u39.p301==1)))) + (i...1028
Reverse transition relation is NOT exact ! Due to transitions t20, t63, t110, t155, t173, t176, t177, t178, t187, t207, t213, t216, t217, t218, t234, t240,...1100
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Graph (trivial) has 211 edges and 258 vertex of which 26 / 258 are part of one of the 3 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 234 transition count 412
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 44 rules applied. Total rules applied 84 place count 195 transition count 407
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 192 transition count 406
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 88 place count 192 transition count 401
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 98 place count 187 transition count 401
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 137 place count 148 transition count 352
Iterating global reduction 3 with 39 rules applied. Total rules applied 176 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 148 transition count 351
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 177 place count 148 transition count 346
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 187 place count 143 transition count 346
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 202 place count 128 transition count 301
Iterating global reduction 4 with 15 rules applied. Total rules applied 217 place count 128 transition count 301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 223 place count 128 transition count 295
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 224 place count 127 transition count 293
Iterating global reduction 5 with 1 rules applied. Total rules applied 225 place count 127 transition count 293
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 226 place count 126 transition count 290
Iterating global reduction 5 with 1 rules applied. Total rules applied 227 place count 126 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 126 transition count 289
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 264 place count 108 transition count 271
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 270 place count 102 transition count 253
Iterating global reduction 6 with 6 rules applied. Total rules applied 276 place count 102 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 277 place count 102 transition count 252
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 278 place count 101 transition count 250
Iterating global reduction 7 with 1 rules applied. Total rules applied 279 place count 101 transition count 250
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 280 place count 100 transition count 247
Iterating global reduction 7 with 1 rules applied. Total rules applied 281 place count 100 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 282 place count 100 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 288 place count 100 transition count 240
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 294 place count 97 transition count 237
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 297 place count 94 transition count 228
Iterating global reduction 8 with 3 rules applied. Total rules applied 300 place count 94 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 303 place count 94 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 304 place count 93 transition count 224
Applied a total of 304 rules in 76 ms. Remains 93 /258 variables (removed 165) and now considering 224/485 (removed 261) transitions.
[2025-06-02 21:18:04] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
// Phase 1: matrix 214 rows 93 cols
[2025-06-02 21:18:04] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:18:04] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-02 21:18:04] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
[2025-06-02 21:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:18:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:18:04] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:18:04] [INFO ] Redundant transitions in 3 ms returned []
Running 195 sub problems to find dead transitions.
[2025-06-02 21:18:04] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
[2025-06-02 21:18:04] [INFO ] Invariant cache hit.
[2025-06-02 21:18:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 213/303 variables, 90/98 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:10] [INFO ] Deduced a trap along path composed of 6 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:12] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:15] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:18] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 3/306 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/307 variables, and 106 constraints, problems are : Problem set: 0 solved, 195 unsolved in 26179 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 213/303 variables, 90/98 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 29/128 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:36] [INFO ] Deduced a trap along path composed of 6 places in 29 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 3/306 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 166/302 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/307 variables, and 302 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 56241ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 56242ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/258 places, 224/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56702 ms. Remains : 93/258 places, 224/485 transitions.
[2025-06-02 21:19:00] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:19:00] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:19:00] [INFO ] Input system was already deterministic with 224 transitions.
[2025-06-02 21:19:00] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:19:00] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:19:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality8203923771814789231.gal : 3 ms
[2025-06-02 21:19:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13817331647179235001.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/CTLCardinality8203923771814789231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13817331647179235001.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,3.03218e+07,17.082,290248,2,12025,5,690415,6,0,591,1.08583e+06,0


Converting to forward existential form...Done !
original formula: E(EG((EF((p270==1)) * !((((!((p335==0)||(p48==1)))&&(p127!=1))&&(((p96==0)||(p39==0))||(p181==1)))))) U !((((p352==0)||(p7==1))||(p43==1)...158
=> equivalent forward existential formula: [(FwdU(Init,EG((E(TRUE U (p270==1)) * !((((!((p335==0)||(p48==1)))&&(p127!=1))&&(((p96==0)||(p39==0))||(p181==1)...210
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t13, t14, t17, t20, t21, t27, t30, t31, t35, t38, t39, t43, t46, t51, t52, t54, t...548
Detected timeout of ITS tools.
[2025-06-02 21:19:30] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:19:30] [INFO ] Applying decomposition
[2025-06-02 21:19:30] [INFO ] Flatten gal took : 7 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/graph7970511295731025978.txt' '-o' '/tmp/graph7970511295731025978.bin' '-w' '/tmp/graph7970511295731025978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7970511295731025978.bin' '-l' '-1' '-v' '-w' '/tmp/graph7970511295731025978.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:19:30] [INFO ] Decomposing Gal with order
[2025-06-02 21:19:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:19:30] [INFO ] Removed a total of 365 redundant transitions.
[2025-06-02 21:19:30] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:19:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2025-06-02 21:19:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality17281360862582383836.gal : 2 ms
[2025-06-02 21:19:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality8718088646154910592.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/CTLCardinality17281360862582383836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8718088646154910592.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.03218e+07,0.831103,21480,447,126,30013,1008,488,62418,102,2490,0


Converting to forward existential form...Done !
original formula: E(EG((EF((i5.u18.p270==1)) * !((((!((i6.u19.p335==0)||(i3.u4.p48==1)))&&(i3.u9.p127!=1))&&(((i3.u6.p96==0)||(i3.u9.p39==0))||(i4.i1.u11.p...225
=> equivalent forward existential formula: [(FwdU(Init,EG((E(TRUE U (i5.u18.p270==1)) * !((((!((i6.u19.p335==0)||(i3.u4.p48==1)))&&(i3.u9.p127!=1))&&(((i3....277
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t101, t102, t103, t104, t105, t106, t122, t123, t124, t125, t126, t127, t139, ...647
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,22.5071,406144,1,0,581092,23104,2690,1.756e+06,551,170461,985853
FORMULA MedleyA-PT-23-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Graph (trivial) has 220 edges and 258 vertex of which 25 / 258 are part of one of the 3 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 235 transition count 407
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 190 transition count 404
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 94 place count 190 transition count 398
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 184 transition count 398
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 149 place count 141 transition count 345
Iterating global reduction 2 with 43 rules applied. Total rules applied 192 place count 141 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 194 place count 141 transition count 343
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 194 place count 141 transition count 338
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 204 place count 136 transition count 338
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 223 place count 117 transition count 282
Iterating global reduction 3 with 19 rules applied. Total rules applied 242 place count 117 transition count 282
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 250 place count 117 transition count 274
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 252 place count 115 transition count 269
Iterating global reduction 4 with 2 rules applied. Total rules applied 254 place count 115 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 115 transition count 268
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 114 transition count 265
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 114 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 114 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 294 place count 96 transition count 246
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 301 place count 89 transition count 225
Iterating global reduction 6 with 7 rules applied. Total rules applied 308 place count 89 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 309 place count 89 transition count 224
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 310 place count 88 transition count 222
Iterating global reduction 7 with 1 rules applied. Total rules applied 311 place count 88 transition count 222
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 312 place count 87 transition count 219
Iterating global reduction 7 with 1 rules applied. Total rules applied 313 place count 87 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 314 place count 87 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 319 place count 87 transition count 213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 325 place count 84 transition count 210
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 328 place count 81 transition count 201
Iterating global reduction 8 with 3 rules applied. Total rules applied 331 place count 81 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 334 place count 81 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 336 place count 79 transition count 196
Applied a total of 336 rules in 58 ms. Remains 79 /258 variables (removed 179) and now considering 196/485 (removed 289) transitions.
[2025-06-02 21:19:53] [INFO ] Flow matrix only has 186 transitions (discarded 10 similar events)
// Phase 1: matrix 186 rows 79 cols
[2025-06-02 21:19:53] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:19:53] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 21:19:53] [INFO ] Flow matrix only has 186 transitions (discarded 10 similar events)
[2025-06-02 21:19:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:19:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:19:53] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:19:53] [INFO ] Redundant transitions in 3 ms returned []
Running 170 sub problems to find dead transitions.
[2025-06-02 21:19:53] [INFO ] Flow matrix only has 186 transitions (discarded 10 similar events)
[2025-06-02 21:19:53] [INFO ] Invariant cache hit.
[2025-06-02 21:19:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 185/261 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 3/264 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 88 constraints, problems are : Problem set: 0 solved, 170 unsolved in 12450 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 185/261 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 25/110 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 3/264 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 145/258 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:15] [INFO ] Deduced a trap along path composed of 2 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:15] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/264 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 260 constraints, problems are : Problem set: 0 solved, 170 unsolved in 21532 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 34035ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 34037ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/258 places, 196/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34354 ms. Remains : 79/258 places, 196/485 transitions.
[2025-06-02 21:20:27] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:20:27] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:20:27] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-02 21:20:27] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:20:27] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:20:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality6782322805372854348.gal : 1 ms
[2025-06-02 21:20:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality12055765174736419623.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/CTLCardinality6782322805372854348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12055765174736419623.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,1.16567e+07,9.72617,173808,2,7607,5,436052,6,0,508,659307,0


Converting to forward existential form...Done !
original formula: AG(!(E(!(AF((((p325==0)||(p130==1))||(p375==0)))) U !(EF((p60!=0))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),!(!(EG(!((((p325==0)||(p130==1))||(p375==0))))))) * !(E(TRUE U (p60!=0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t6, t13, t14, t17, t20, t21, t28, t29, t32, t35, t36, t44, t45, t49, t72, t73, t7...465
Detected timeout of ITS tools.
[2025-06-02 21:20:58] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:20:58] [INFO ] Applying decomposition
[2025-06-02 21:20:58] [INFO ] Flatten gal took : 5 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/graph13056763133158285142.txt' '-o' '/tmp/graph13056763133158285142.bin' '-w' '/tmp/graph13056763133158285142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13056763133158285142.bin' '-l' '-1' '-v' '-w' '/tmp/graph13056763133158285142.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:20:58] [INFO ] Decomposing Gal with order
[2025-06-02 21:20:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:20:58] [INFO ] Removed a total of 299 redundant transitions.
[2025-06-02 21:20:58] [INFO ] Flatten gal took : 29 ms
[2025-06-02 21:20:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 12 ms.
[2025-06-02 21:20:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality10445566344892217040.gal : 1 ms
[2025-06-02 21:20:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality2240181967889224633.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/CTLCardinality10445566344892217040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2240181967889224633.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16567e+07,0.147836,7852,260,144,6642,1060,387,11995,106,4043,0


Converting to forward existential form...Done !
original formula: AG(!(E(!(AF((((i4.u14.p325==0)||(i1.u7.p130==1))||(i8.u20.p375==0)))) U !(EF((i1.u4.p60!=0))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),!(!(EG(!((((i4.u14.p325==0)||(i1.u7.p130==1))||(i8.u20.p375==0))))))) * !(E(TRUE U (i1.u4...175
Reverse transition relation is NOT exact ! Due to transitions t72, t73, t74, t84, t85, t86, t102, t103, t104, t116, t118, t119, t120, t121, t123, t126, t12...501
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,6.09261,135340,1,0,187565,19955,2141,545236,549,161734,367126
FORMULA MedleyA-PT-23-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 209 transition count 428
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 209 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 209 transition count 427
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 126 place count 182 transition count 398
Iterating global reduction 1 with 27 rules applied. Total rules applied 153 place count 182 transition count 398
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 171 place count 164 transition count 354
Iterating global reduction 1 with 18 rules applied. Total rules applied 189 place count 164 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 191 place count 164 transition count 352
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 199 place count 156 transition count 333
Iterating global reduction 2 with 8 rules applied. Total rules applied 207 place count 156 transition count 333
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 211 place count 156 transition count 329
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 215 place count 152 transition count 319
Iterating global reduction 3 with 4 rules applied. Total rules applied 219 place count 152 transition count 319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 223 place count 152 transition count 315
Applied a total of 223 rules in 11 ms. Remains 152 /258 variables (removed 106) and now considering 315/485 (removed 170) transitions.
// Phase 1: matrix 315 rows 152 cols
[2025-06-02 21:21:04] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:21:04] [INFO ] Implicit Places using invariants in 342 ms returned []
[2025-06-02 21:21:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:21:04] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2025-06-02 21:21:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:21:08] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/467 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:21:12] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:21:21] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:21:21] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:21:21] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/467 variables, and 165 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/467 variables, 152/162 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 314/476 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:21:41] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:21:50] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 314 unsolved
SMT process timed out in 60114ms, After SMT, problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 152/258 places, 315/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60756 ms. Remains : 152/258 places, 315/485 transitions.
[2025-06-02 21:22:05] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:22:05] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:22:05] [INFO ] Input system was already deterministic with 315 transitions.
[2025-06-02 21:22:05] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:22:05] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:22:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality32388757447036458.gal : 3 ms
[2025-06-02 21:22:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality17521014524152462285.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/CTLCardinality32388757447036458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17521014524152462285.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-02 21:22:35] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:22:35] [INFO ] Applying decomposition
[2025-06-02 21:22:35] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph910074939186790474.txt' '-o' '/tmp/graph910074939186790474.bin' '-w' '/tmp/graph910074939186790474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph910074939186790474.bin' '-l' '-1' '-v' '-w' '/tmp/graph910074939186790474.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:22:35] [INFO ] Decomposing Gal with order
[2025-06-02 21:22:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:22:35] [INFO ] Removed a total of 458 redundant transitions.
[2025-06-02 21:22:35] [INFO ] Flatten gal took : 48 ms
[2025-06-02 21:22:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2025-06-02 21:22:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality6909323732750398904.gal : 3 ms
[2025-06-02 21:22:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality16440951659545440378.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/CTLCardinality6909323732750398904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16440951659545440378.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.55362e+09,3.98745,86572,1493,61,143384,653,599,279596,88,1547,0


Converting to forward existential form...Done !
original formula: (AX(((AF(((i6.u32.p313==0)||(i6.u36.p331==1))) + EX(TRUE)) + ((i4.u3.p17==1)&&((i6.u35.p329==0)||(i9.u45.p370==1))))) * AF((((i2.u12.p102...228
=> equivalent forward existential formula: ([FwdG(((EY(Init) * !(((i4.u3.p17==1)&&((i6.u35.p329==0)||(i9.u45.p370==1))))) * !(EX(TRUE))),!(((i6.u32.p313==0...305
Reverse transition relation is NOT exact ! Due to transitions t20, t54, t118, t136, t138, t139, t172, t174, t175, t196, t198, t199, t204, t205, t206, t207,...830
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 213 transition count 434
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 213 transition count 434
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 115 place count 188 transition count 407
Iterating global reduction 0 with 25 rules applied. Total rules applied 140 place count 188 transition count 407
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 156 place count 172 transition count 368
Iterating global reduction 0 with 16 rules applied. Total rules applied 172 place count 172 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 173 place count 172 transition count 367
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 181 place count 164 transition count 347
Iterating global reduction 1 with 8 rules applied. Total rules applied 189 place count 164 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 194 place count 164 transition count 342
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 197 place count 161 transition count 335
Iterating global reduction 2 with 3 rules applied. Total rules applied 200 place count 161 transition count 335
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 203 place count 161 transition count 332
Applied a total of 203 rules in 13 ms. Remains 161 /258 variables (removed 97) and now considering 332/485 (removed 153) transitions.
// Phase 1: matrix 332 rows 161 cols
[2025-06-02 21:23:05] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:23:05] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-02 21:23:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:23:06] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2025-06-02 21:23:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 332/493 variables, 161/169 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:19] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:30] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:30] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:31] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/493 variables, and 173 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 332/493 variables, 161/170 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 331/501 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:44] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:44] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:54] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:56] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:56] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 331 unsolved
SMT process timed out in 60105ms, After SMT, problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 161/258 places, 332/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60742 ms. Remains : 161/258 places, 332/485 transitions.
[2025-06-02 21:24:06] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:24:06] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:24:06] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-02 21:24:06] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:24:06] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:24:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality17785325702656623969.gal : 4 ms
[2025-06-02 21:24:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality9283322093774902041.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/CTLCardinality17785325702656623969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9283322093774902041.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-02 21:24:36] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:24:36] [INFO ] Applying decomposition
[2025-06-02 21:24:36] [INFO ] Flatten gal took : 7 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/graph17912546856529435951.txt' '-o' '/tmp/graph17912546856529435951.bin' '-w' '/tmp/graph17912546856529435951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17912546856529435951.bin' '-l' '-1' '-v' '-w' '/tmp/graph17912546856529435951.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:24:36] [INFO ] Decomposing Gal with order
[2025-06-02 21:24:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:24:36] [INFO ] Removed a total of 483 redundant transitions.
[2025-06-02 21:24:36] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:24:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2025-06-02 21:24:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality4691660983027875067.gal : 4 ms
[2025-06-02 21:24:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality12864010082718246413.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/CTLCardinality4691660983027875067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12864010082718246413.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18941e+10,22.4326,401024,2455,78,716925,934,679,1.30317e+06,94,3191,0


Converting to forward existential form...Done !
original formula: E((AX(EX((((i5.u35.p291==0)||(i2.u15.p118==1))||(i3.i0.u23.p180==0)))) + (!((EX(((i3.i0.u24.p177==0)||(i9.u50.p373==1))) + (i3.i1.u20.p15...271
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!(EX(!(EX((((i5.u35.p291==0)||(i2.u15.p118==1))||(i3.i0.u23.p180==0)))))) + (!((EX(((i3.i0.u24....339
Reverse transition relation is NOT exact ! Due to transitions t19, t56, t147, t149, t150, t158, t178, t185, t187, t188, t203, t210, t212, t213, t218, t219,...1196
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 207 transition count 426
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 207 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 207 transition count 425
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 131 place count 179 transition count 395
Iterating global reduction 1 with 28 rules applied. Total rules applied 159 place count 179 transition count 395
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 178 place count 160 transition count 348
Iterating global reduction 1 with 19 rules applied. Total rules applied 197 place count 160 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 199 place count 160 transition count 346
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 208 place count 151 transition count 324
Iterating global reduction 2 with 9 rules applied. Total rules applied 217 place count 151 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 222 place count 151 transition count 319
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 226 place count 147 transition count 309
Iterating global reduction 3 with 4 rules applied. Total rules applied 230 place count 147 transition count 309
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 234 place count 147 transition count 305
Applied a total of 234 rules in 12 ms. Remains 147 /258 variables (removed 111) and now considering 305/485 (removed 180) transitions.
// Phase 1: matrix 305 rows 147 cols
[2025-06-02 21:25:06] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:25:06] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-02 21:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:25:06] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-02 21:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 305/452 variables, 147/155 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:18] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:27] [INFO ] Deduced a trap along path composed of 3 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-02 21:25:27] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:28] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/452 variables, and 159 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/452 variables, 147/156 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 304/460 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 3/463 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:57] [INFO ] Deduced a trap along path composed of 9 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:57] [INFO ] Deduced a trap along path composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 465 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 147/258 places, 305/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60510 ms. Remains : 147/258 places, 305/485 transitions.
[2025-06-02 21:26:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:26:06] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:26:06] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-02 21:26:07] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:26:07] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:26:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality16134517401941017910.gal : 2 ms
[2025-06-02 21:26:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality4478797313588730404.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/CTLCardinality16134517401941017910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4478797313588730404.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-02 21:26:37] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:26:37] [INFO ] Applying decomposition
[2025-06-02 21:26:37] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9405492121342724221.txt' '-o' '/tmp/graph9405492121342724221.bin' '-w' '/tmp/graph9405492121342724221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9405492121342724221.bin' '-l' '-1' '-v' '-w' '/tmp/graph9405492121342724221.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:26:37] [INFO ] Decomposing Gal with order
[2025-06-02 21:26:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:26:37] [INFO ] Removed a total of 441 redundant transitions.
[2025-06-02 21:26:37] [INFO ] Flatten gal took : 31 ms
[2025-06-02 21:26:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2025-06-02 21:26:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality15185506253784681319.gal : 5 ms
[2025-06-02 21:26:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality5355734112496514901.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/CTLCardinality15185506253784681319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5355734112496514901.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.8027e+09,4.69074,85824,1278,43,139944,654,623,277373,69,2077,0


Converting to forward existential form...Done !
original formula: AF(EX(AG(EX(TRUE))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !(EX(TRUE)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t132, t134, t135, t168, t170, t171, t192, t194, t195, t200, t201, t202, t203, t205,...871
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Graph (trivial) has 210 edges and 258 vertex of which 28 / 258 are part of one of the 3 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 232 transition count 411
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 195 transition count 409
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 77 place count 195 transition count 402
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 91 place count 188 transition count 402
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 131 place count 148 transition count 352
Iterating global reduction 2 with 40 rules applied. Total rules applied 171 place count 148 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 173 place count 148 transition count 350
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 173 place count 148 transition count 345
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 183 place count 143 transition count 345
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 199 place count 127 transition count 298
Iterating global reduction 3 with 16 rules applied. Total rules applied 215 place count 127 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 221 place count 127 transition count 292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 222 place count 126 transition count 289
Iterating global reduction 4 with 1 rules applied. Total rules applied 223 place count 126 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 224 place count 126 transition count 288
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 260 place count 108 transition count 270
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 267 place count 101 transition count 249
Iterating global reduction 5 with 7 rules applied. Total rules applied 274 place count 101 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 275 place count 101 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 281 place count 101 transition count 242
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 287 place count 98 transition count 239
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 289 place count 96 transition count 233
Iterating global reduction 6 with 2 rules applied. Total rules applied 291 place count 96 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 293 place count 96 transition count 231
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 295 place count 94 transition count 229
Applied a total of 295 rules in 65 ms. Remains 94 /258 variables (removed 164) and now considering 229/485 (removed 256) transitions.
[2025-06-02 21:27:07] [INFO ] Flow matrix only has 219 transitions (discarded 10 similar events)
// Phase 1: matrix 219 rows 94 cols
[2025-06-02 21:27:07] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:27:07] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-02 21:27:07] [INFO ] Flow matrix only has 219 transitions (discarded 10 similar events)
[2025-06-02 21:27:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:27:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:27:07] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:27:07] [INFO ] Redundant transitions in 3 ms returned []
Running 200 sub problems to find dead transitions.
[2025-06-02 21:27:07] [INFO ] Flow matrix only has 219 transitions (discarded 10 similar events)
[2025-06-02 21:27:07] [INFO ] Invariant cache hit.
[2025-06-02 21:27:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 218/309 variables, 91/99 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:13] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 3/312 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:21] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/313 variables, and 105 constraints, problems are : Problem set: 0 solved, 200 unsolved in 22083 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 218/309 variables, 91/99 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 30/130 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 3/312 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 170/305 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/313 variables, and 305 constraints, problems are : Problem set: 0 solved, 200 unsolved in 20635 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42778ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 42781ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/258 places, 229/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43222 ms. Remains : 94/258 places, 229/485 transitions.
[2025-06-02 21:27:50] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:27:50] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:27:50] [INFO ] Input system was already deterministic with 229 transitions.
[2025-06-02 21:27:50] [INFO ] Flatten gal took : 9 ms
[2025-06-02 21:27:50] [INFO ] Flatten gal took : 9 ms
[2025-06-02 21:27:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7478846620760595684.gal : 3 ms
[2025-06-02 21:27:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11757730560838454732.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/CTLCardinality7478846620760595684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11757730560838454732.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,2.38592e+07,13.6541,239156,2,11805,5,559551,6,0,601,899125,0


Converting to forward existential form...Done !
original formula: AF(E(EG(((p219==0)||(p308==1))) U (EG(((p289==0)||(p347==1))) * AG((((p177==1)&&(p237==1))&&((p69==0)||(p197==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(EG(((p219==0)||(p308==1))) U (EG(((p289==0)||(p347==1))) * !(E(TRUE U !((((p177==1)&&(p237==1))&&...193
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t10, t13, t18, t19, t21, t24, t27, t28, t32, t34, t41, t42, t44, t45, t48, t5...524
Detected timeout of ITS tools.
[2025-06-02 21:28:20] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:28:20] [INFO ] Applying decomposition
[2025-06-02 21:28:20] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16615608277951715256.txt' '-o' '/tmp/graph16615608277951715256.bin' '-w' '/tmp/graph16615608277951715256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16615608277951715256.bin' '-l' '-1' '-v' '-w' '/tmp/graph16615608277951715256.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:28:20] [INFO ] Decomposing Gal with order
[2025-06-02 21:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:28:20] [INFO ] Removed a total of 334 redundant transitions.
[2025-06-02 21:28:20] [INFO ] Flatten gal took : 14 ms
[2025-06-02 21:28:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 2 ms.
[2025-06-02 21:28:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality15141243522655409789.gal : 2 ms
[2025-06-02 21:28:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality816010277174747166.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/CTLCardinality15141243522655409789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality816010277174747166.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.38592e+07,0.326701,12468,374,244,13283,4220,445,26493,137,15462,0


Converting to forward existential form...Done !
original formula: AF(E(EG(((i3.u7.p219==0)||(i5.u16.p308==1))) U (EG(((i5.u14.p289==0)||(u17.p347==1))) * AG((((i3.u9.p177==1)&&(i5.u13.p237==1))&&((i2.u4....186
=> equivalent forward existential formula: [FwdG(Init,!(E(EG(((i3.u7.p219==0)||(i5.u16.p308==1))) U (EG(((i5.u14.p289==0)||(u17.p347==1))) * !(E(TRUE U !((...243
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t107, t108, t109, t128, t129, t130, t131, t133, t143, t146, t147, t150, t151, ...610
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,12.6361,324492,1,0,474498,70428,2958,1.31066e+06,777,531507,738960
FORMULA MedleyA-PT-23-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 209 transition count 428
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 209 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 209 transition count 427
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 126 place count 182 transition count 398
Iterating global reduction 1 with 27 rules applied. Total rules applied 153 place count 182 transition count 398
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 170 place count 165 transition count 355
Iterating global reduction 1 with 17 rules applied. Total rules applied 187 place count 165 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 189 place count 165 transition count 353
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 197 place count 157 transition count 334
Iterating global reduction 2 with 8 rules applied. Total rules applied 205 place count 157 transition count 334
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 210 place count 157 transition count 329
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 213 place count 154 transition count 321
Iterating global reduction 3 with 3 rules applied. Total rules applied 216 place count 154 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 219 place count 154 transition count 318
Applied a total of 219 rules in 10 ms. Remains 154 /258 variables (removed 104) and now considering 318/485 (removed 167) transitions.
// Phase 1: matrix 318 rows 154 cols
[2025-06-02 21:28:33] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:28:33] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 21:28:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:28:33] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2025-06-02 21:28:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (OVERLAPS) 318/472 variables, 154/162 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:28:45] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:02] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:02] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:03] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/472 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 166 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 318/472 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 317/480 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:23] [INFO ] Deduced a trap along path composed of 9 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:23] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:24] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 1)
(t5 1)
(t6 2)
(t7 1)
(t8 1)
(t9 4)
(t10 3)
(t11 4)
(t12 5)
(t13 1)
(t14 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 486 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 154/258 places, 318/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60494 ms. Remains : 154/258 places, 318/485 transitions.
[2025-06-02 21:29:33] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:29:33] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:29:33] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-02 21:29:33] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:29:33] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:29:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality11774209269744405299.gal : 3 ms
[2025-06-02 21:29:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality11274136259867501201.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/CTLCardinality11774209269744405299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11274136259867501201.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-02 21:30:04] [INFO ] Flatten gal took : 25 ms
[2025-06-02 21:30:04] [INFO ] Applying decomposition
[2025-06-02 21:30:04] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14639328563759735975.txt' '-o' '/tmp/graph14639328563759735975.bin' '-w' '/tmp/graph14639328563759735975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14639328563759735975.bin' '-l' '-1' '-v' '-w' '/tmp/graph14639328563759735975.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:30:04] [INFO ] Decomposing Gal with order
[2025-06-02 21:30:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:30:04] [INFO ] Removed a total of 461 redundant transitions.
[2025-06-02 21:30:04] [INFO ] Flatten gal took : 20 ms
[2025-06-02 21:30:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2025-06-02 21:30:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality3179617668388762373.gal : 4 ms
[2025-06-02 21:30:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality2637477134967385685.ctl : 4 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/CTLCardinality3179617668388762373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2637477134967385685.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.44759e+09,3.38525,76440,1573,59,121645,852,689,302735,67,2869,0


Converting to forward existential form...Done !
original formula: (AF(!(E(!((AF((i4.i0.u23.p185==0)) + ((i9.u46.p366==0)&&(i5.i1.u28.p305==1)))) U AG((((i5.i1.u28.p304==0)||(i4.i0.u17.p170==1))||(i5.i1.u...240
=> equivalent forward existential formula: [(EY((Init * !(!(EG(!(!(E(!((!(EG(!((i4.i0.u23.p185==0)))) + ((i9.u46.p366==0)&&(i5.i1.u28.p305==1)))) U !(E(TRU...320
Reverse transition relation is NOT exact ! Due to transitions t19, t56, t139, t142, t143, t176, t179, t180, t201, t204, t205, t213, t214, t215, t217, t218,...936
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Graph (trivial) has 215 edges and 258 vertex of which 28 / 258 are part of one of the 3 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 232 transition count 408
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 86 place count 192 transition count 403
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 190 transition count 403
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 88 place count 190 transition count 397
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 100 place count 184 transition count 397
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 140 place count 144 transition count 347
Iterating global reduction 3 with 40 rules applied. Total rules applied 180 place count 144 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 182 place count 144 transition count 345
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 182 place count 144 transition count 341
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 190 place count 140 transition count 341
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 204 place count 126 transition count 299
Iterating global reduction 4 with 14 rules applied. Total rules applied 218 place count 126 transition count 299
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 224 place count 126 transition count 293
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 262 place count 107 transition count 274
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 269 place count 100 transition count 253
Iterating global reduction 5 with 7 rules applied. Total rules applied 276 place count 100 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 277 place count 100 transition count 252
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 278 place count 99 transition count 250
Iterating global reduction 6 with 1 rules applied. Total rules applied 279 place count 99 transition count 250
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 280 place count 98 transition count 247
Iterating global reduction 6 with 1 rules applied. Total rules applied 281 place count 98 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 282 place count 98 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 288 place count 98 transition count 240
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 294 place count 95 transition count 237
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 297 place count 92 transition count 228
Iterating global reduction 7 with 3 rules applied. Total rules applied 300 place count 92 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 303 place count 92 transition count 225
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 305 place count 92 transition count 225
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 307 place count 90 transition count 223
Applied a total of 307 rules in 67 ms. Remains 90 /258 variables (removed 168) and now considering 223/485 (removed 262) transitions.
[2025-06-02 21:30:34] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
// Phase 1: matrix 214 rows 90 cols
[2025-06-02 21:30:34] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:30:34] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 21:30:34] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
[2025-06-02 21:30:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:30:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:30:34] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:30:34] [INFO ] Redundant transitions in 2 ms returned []
Running 193 sub problems to find dead transitions.
[2025-06-02 21:30:34] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
[2025-06-02 21:30:34] [INFO ] Invariant cache hit.
[2025-06-02 21:30:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 212/299 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:40] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:44] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 4/303 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/304 variables, and 101 constraints, problems are : Problem set: 0 solved, 193 unsolved in 20493 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 212/299 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 25/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 4/303 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 168/294 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/304 variables, and 294 constraints, problems are : Problem set: 0 solved, 193 unsolved in 17375 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 37956ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 37959ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/258 places, 223/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38413 ms. Remains : 90/258 places, 223/485 transitions.
[2025-06-02 21:31:12] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:31:12] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:31:12] [INFO ] Input system was already deterministic with 223 transitions.
[2025-06-02 21:31:12] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:31:12] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:31:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality1694182116911861333.gal : 1 ms
[2025-06-02 21:31:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality16809380768010955819.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/CTLCardinality1694182116911861333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16809380768010955819.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,2.22706e+07,21.2339,374480,2,10667,5,806274,6,0,579,1.28014e+06,0


Converting to forward existential form...Done !
original formula: AF(AG(!(E(!((((p39==0)||(p266==1))||(p298==0))) U A(((p368==0)||(p85==1)) U (p97==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(E(!((((p39==0)||(p266==1))||(p298==0))) U !((E(!((p97==1)) U (!(((p368==0)||(p85==1)...209
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t12, t13, t21, t24, t25, t32, t33, t36, t39, t40, t44, t48, t52, t53, t87, t88, t...513
Detected timeout of ITS tools.
[2025-06-02 21:31:42] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:31:42] [INFO ] Applying decomposition
[2025-06-02 21:31:42] [INFO ] Flatten gal took : 5 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/graph15904178754724798464.txt' '-o' '/tmp/graph15904178754724798464.bin' '-w' '/tmp/graph15904178754724798464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15904178754724798464.bin' '-l' '-1' '-v' '-w' '/tmp/graph15904178754724798464.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:31:42] [INFO ] Decomposing Gal with order
[2025-06-02 21:31:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:31:42] [INFO ] Removed a total of 358 redundant transitions.
[2025-06-02 21:31:42] [INFO ] Flatten gal took : 14 ms
[2025-06-02 21:31:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2025-06-02 21:31:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality7139272246964146334.gal : 3 ms
[2025-06-02 21:31:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14499520779568618236.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/CTLCardinality7139272246964146334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14499520779568618236.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22706e+07,0.261083,10732,421,160,11544,1330,446,24195,101,3641,0


Converting to forward existential form...Done !
original formula: AF(AG(!(E(!((((i1.i0.u9.p39==0)||(i4.u14.p266==1))||(i4.u15.p298==0))) U A(((i8.u23.p368==0)||(i1.i1.u5.p85==1)) U (i1.i0.u7.p97==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(E(!((((i1.i0.u9.p39==0)||(i4.u14.p266==1))||(i4.u15.p298==0))) U !((E(!((i1.i0.u7.p9...275
Reverse transition relation is NOT exact ! Due to transitions t87, t88, t89, t99, t100, t101, t123, t124, t125, t126, t127, t128, t140, t142, t144, t148, t...588
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Graph (trivial) has 215 edges and 258 vertex of which 28 / 258 are part of one of the 3 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 232 transition count 410
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 194 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 193 transition count 406
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 82 place count 193 transition count 398
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 98 place count 185 transition count 398
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 137 place count 146 transition count 349
Iterating global reduction 3 with 39 rules applied. Total rules applied 176 place count 146 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 178 place count 146 transition count 347
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 178 place count 146 transition count 342
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 188 place count 141 transition count 342
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 202 place count 127 transition count 301
Iterating global reduction 4 with 14 rules applied. Total rules applied 216 place count 127 transition count 301
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 221 place count 127 transition count 296
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 223 place count 125 transition count 291
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 125 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 226 place count 125 transition count 290
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 227 place count 124 transition count 287
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 place count 124 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 229 place count 124 transition count 286
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 265 place count 106 transition count 268
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 272 place count 99 transition count 247
Iterating global reduction 7 with 7 rules applied. Total rules applied 279 place count 99 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 280 place count 99 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 286 place count 99 transition count 240
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 292 place count 96 transition count 237
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 295 place count 93 transition count 228
Iterating global reduction 8 with 3 rules applied. Total rules applied 298 place count 93 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 301 place count 93 transition count 225
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 303 place count 91 transition count 223
Applied a total of 303 rules in 45 ms. Remains 91 /258 variables (removed 167) and now considering 223/485 (removed 262) transitions.
[2025-06-02 21:32:12] [INFO ] Flow matrix only has 213 transitions (discarded 10 similar events)
// Phase 1: matrix 213 rows 91 cols
[2025-06-02 21:32:12] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:32:12] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-02 21:32:12] [INFO ] Flow matrix only has 213 transitions (discarded 10 similar events)
[2025-06-02 21:32:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:32:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:32:13] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:32:13] [INFO ] Redundant transitions in 2 ms returned []
Running 195 sub problems to find dead transitions.
[2025-06-02 21:32:13] [INFO ] Flow matrix only has 213 transitions (discarded 10 similar events)
[2025-06-02 21:32:13] [INFO ] Invariant cache hit.
[2025-06-02 21:32:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 212/300 variables, 88/96 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:32:19] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 3/303 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:32:31] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/303 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/304 variables, and 102 constraints, problems are : Problem set: 0 solved, 195 unsolved in 28164 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 212/300 variables, 88/96 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 26/123 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 3/303 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 169/297 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/304 variables, and 297 constraints, problems are : Problem set: 0 solved, 195 unsolved in 16557 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44765ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 44768ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/258 places, 223/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45141 ms. Remains : 91/258 places, 223/485 transitions.
[2025-06-02 21:32:57] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:32:57] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:32:57] [INFO ] Input system was already deterministic with 223 transitions.
[2025-06-02 21:32:58] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:32:58] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:32:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1290237516907743475.gal : 1 ms
[2025-06-02 21:32:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality14168894103934589837.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/CTLCardinality1290237516907743475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14168894103934589837.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,2.08753e+07,10.8301,227748,2,11840,5,536945,6,0,583,820510,0


Converting to forward existential form...Done !
original formula: EF(!(A(EF(EG((p268==1))) U ((!(AG((p255==0))) * ((p138==0)||(p117==1))) + !((AG((p191==0)) * (p357!=1)))))))
=> equivalent forward existential formula: (([(((FwdU(FwdU(Init,TRUE),!(((!(!(E(TRUE U !((p255==0))))) * ((p138==0)||(p117==1))) + !((!(E(TRUE U !((p191==0...689
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t13, t14, t15, t17, t20, t23, t24, t30, t31, t36, t37, t40, t43, t47, t54, t55, t...520
Detected timeout of ITS tools.
[2025-06-02 21:33:28] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:33:28] [INFO ] Applying decomposition
[2025-06-02 21:33:28] [INFO ] Flatten gal took : 6 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/graph12737701895583531491.txt' '-o' '/tmp/graph12737701895583531491.bin' '-w' '/tmp/graph12737701895583531491.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12737701895583531491.bin' '-l' '-1' '-v' '-w' '/tmp/graph12737701895583531491.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:33:28] [INFO ] Decomposing Gal with order
[2025-06-02 21:33:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:33:28] [INFO ] Removed a total of 364 redundant transitions.
[2025-06-02 21:33:28] [INFO ] Flatten gal took : 14 ms
[2025-06-02 21:33:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 4 ms.
[2025-06-02 21:33:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality3054748845321216751.gal : 2 ms
[2025-06-02 21:33:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality4980148108370373568.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/CTLCardinality3054748845321216751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4980148108370373568.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08753e+07,0.290339,11028,390,148,11948,1523,465,24741,112,3882,0


Converting to forward existential form...Done !
original formula: EF(!(A(EF(EG((i5.u14.p268==1))) U ((!(AG((i5.u13.p255==0))) * ((i2.i1.u7.p138==0)||(i1.u4.p117==1))) + !((AG((i2.i1.u9.p191==0)) * (i7.u2...171
=> equivalent forward existential formula: (([(((FwdU(FwdU(Init,TRUE),!(((!(!(E(TRUE U !((i5.u13.p255==0))))) * ((i2.i1.u7.p138==0)||(i1.u4.p117==1))) + !(...871
Reverse transition relation is NOT exact ! Due to transitions t84, t85, t86, t96, t97, t98, t114, t115, t116, t117, t118, t119, t131, t137, t143, t144, t15...588
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,17.2371,395100,1,0,512188,78499,2612,1.7911e+06,621,625430,960462
FORMULA MedleyA-PT-23-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 485/485 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 214 transition count 433
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 214 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 214 transition count 432
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 111 place count 192 transition count 408
Iterating global reduction 1 with 22 rules applied. Total rules applied 133 place count 192 transition count 408
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 145 place count 180 transition count 378
Iterating global reduction 1 with 12 rules applied. Total rules applied 157 place count 180 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 158 place count 180 transition count 377
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 162 place count 176 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 166 place count 176 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 167 place count 176 transition count 366
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 169 place count 174 transition count 361
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 174 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 173 place count 174 transition count 359
Applied a total of 173 rules in 18 ms. Remains 174 /258 variables (removed 84) and now considering 359/485 (removed 126) transitions.
// Phase 1: matrix 359 rows 174 cols
[2025-06-02 21:33:45] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:33:45] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 21:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:33:45] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2025-06-02 21:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (OVERLAPS) 359/533 variables, 174/182 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:00] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:12] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:13] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:14] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/533 variables, and 186 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (OVERLAPS) 359/533 variables, 174/183 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 358/541 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:34:23] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 358 unsolved
SMT process timed out in 60134ms, After SMT, problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 174/258 places, 359/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60585 ms. Remains : 174/258 places, 359/485 transitions.
[2025-06-02 21:34:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:34:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:34:46] [INFO ] Input system was already deterministic with 359 transitions.
[2025-06-02 21:34:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:34:46] [INFO ] Flatten gal took : 15 ms
[2025-06-02 21:34:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality7088882460009462172.gal : 2 ms
[2025-06-02 21:34:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality11877178562631364862.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/CTLCardinality7088882460009462172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11877178562631364862.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-02 21:35:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 21:35:16] [INFO ] Applying decomposition
[2025-06-02 21:35:16] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12688666396803032293.txt' '-o' '/tmp/graph12688666396803032293.bin' '-w' '/tmp/graph12688666396803032293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12688666396803032293.bin' '-l' '-1' '-v' '-w' '/tmp/graph12688666396803032293.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:35:16] [INFO ] Decomposing Gal with order
[2025-06-02 21:35:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:35:16] [INFO ] Removed a total of 506 redundant transitions.
[2025-06-02 21:35:16] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:35:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 3 ms.
[2025-06-02 21:35:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality479667493029400652.gal : 4 ms
[2025-06-02 21:35:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality16834453280844735235.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/CTLCardinality479667493029400652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16834453280844735235.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.59086e+10,12.6511,224908,2608,69,379738,754,705,761013,85,3008,0


Converting to forward existential form...Done !
original formula: A(AX(((!(((((i2.u17.p124==1)||(i4.u21.p192==0)) * EF(((i7.i0.u47.p342==0)||(i5.u33.p253==1)))) * EF((i7.i1.u48.p345==0)))) + (i2.u13.p81=...349
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U !((E(TRUE U (i5.u43.p306==1)) * !(!(EX(!((i5.u38.p281==1)))))))) + (E(((i2.u9.p59==1)...822
Reverse transition relation is NOT exact ! Due to transitions t20, t61, t147, t165, t167, t168, t169, t206, t208, t209, t210, t233, t235, t236, t237, t252,...974
Detected timeout of ITS tools.
[2025-06-02 21:35:46] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:35:46] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:35:46] [INFO ] Applying decomposition
[2025-06-02 21:35:46] [INFO ] Flatten gal took : 17 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/graph564503713178158364.txt' '-o' '/tmp/graph564503713178158364.bin' '-w' '/tmp/graph564503713178158364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph564503713178158364.bin' '-l' '-1' '-v' '-w' '/tmp/graph564503713178158364.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:35:46] [INFO ] Decomposing Gal with order
[2025-06-02 21:35:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:35:46] [INFO ] Removed a total of 684 redundant transitions.
[2025-06-02 21:35:46] [INFO ] Flatten gal took : 38 ms
[2025-06-02 21:35:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 8 ms.
[2025-06-02 21:35:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11837008694620874414.gal : 6 ms
[2025-06-02 21:35:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6276862643379771534.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/CTLCardinality11837008694620874414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6276862643379771534.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 8 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.60822e+11,174.098,2280028,16283,82,3.69836e+06,1208,1097,8.26426e+06,99,4407,0


Converting to forward existential form...Done !
original formula: EX(EF(AG((i5.u63.p271==0))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !((i5.u63.p271==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t64, t91, t186, t230, t240, t241, t243, t244, t245, t252, t254, t255, t256, t257, t276, ...1808
(forward)formula 0,1,601.732,3939784,1,0,5.73182e+06,13620,3241,1.85152e+07,275,133112,6723629
FORMULA MedleyA-PT-23-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2025-06-02 22:04:44] [INFO ] Applying decomposition
[2025-06-02 22:04:44] [INFO ] Flatten gal took : 12 ms
[2025-06-02 22:04:44] [INFO ] Decomposing Gal with order
[2025-06-02 22:04:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:04:44] [INFO ] Removed a total of 472 redundant transitions.
[2025-06-02 22:04:44] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:04:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 275 labels/synchronizations in 7 ms.
[2025-06-02 22:04:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality2959096755407307736.gal : 3 ms
[2025-06-02 22:04:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality10235180548539019282.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/CTLCardinality2959096755407307736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10235180548539019282.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.

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="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r128-smll-174876524200273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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