Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064700738.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 DiscoveryGPU-PT-14a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064700738
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 50K 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 DiscoveryGPU-PT-14a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-15
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-00
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-01
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-02
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-03
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-04
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-05
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-06
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-07
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-08
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-09
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-10
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748949157869

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 11:12:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 11:12:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 11:12:40] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2025-06-03 11:12:40] [INFO ] Transformed 143 places.
[2025-06-03 11:12:40] [INFO ] Transformed 197 transitions.
[2025-06-03 11:12:40] [INFO ] Found NUPN structural information;
[2025-06-03 11:12:40] [INFO ] Parsed PT model containing 143 places and 197 transitions and 633 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Support contains 70 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 134 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 134 transition count 188
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 130 transition count 184
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 130 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 129 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 129 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 41 place count 129 transition count 169
Applied a total of 41 rules in 60 ms. Remains 129 /143 variables (removed 14) and now considering 169/197 (removed 28) transitions.
// Phase 1: matrix 169 rows 129 cols
[2025-06-03 11:12:40] [INFO ] Computed 2 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:12:41] [INFO ] Implicit Places using invariants in 515 ms returned []
[2025-06-03 11:12:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:12:41] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-03 11:12:41] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2025-06-03 11:12:41] [INFO ] Invariant cache hit.
[2025-06-03 11:12:41] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/298 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 108/239 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 239 constraints, problems are : Problem set: 0 solved, 168 unsolved in 13444 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/298 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 108/239 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 168/407 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 407 constraints, problems are : Problem set: 0 solved, 168 unsolved in 13886 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27475ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 27506ms
Starting structural reductions in LTL mode, iteration 1 : 129/143 places, 169/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28666 ms. Remains : 129/143 places, 169/197 transitions.
Support contains 70 out of 129 places after structural reductions.
[2025-06-03 11:13:09] [INFO ] Flatten gal took : 50 ms
[2025-06-03 11:13:09] [INFO ] Flatten gal took : 27 ms
[2025-06-03 11:13:09] [INFO ] Input system was already deterministic with 169 transitions.
Support contains 69 out of 129 places (down from 70) after GAL structural reductions.
RANDOM walk for 40000 steps (266 resets) in 2032 ms. (19 steps per ms) remains 2/66 properties
BEST_FIRST walk for 40003 steps (17 resets) in 248 ms. (160 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (18 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
[2025-06-03 11:13:10] [INFO ] Invariant cache hit.
[2025-06-03 11:13:10] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/55 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 58/113 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 21/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 48/161 variables, 23/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 19/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/161 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 45/206 variables, 21/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/206 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 51/257 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/257 variables, 15/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/257 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 15/272 variables, 8/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/272 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 8/280 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/280 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/280 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/286 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/286 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/292 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/292 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/292 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 6/298 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/298 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/298 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp63 is UNSAT
After SMT solving in domain Int declared 5/298 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/129 constraints, ReadFeed: 0/108 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-03 11:13:11] [INFO ] Flatten gal took : 21 ms
[2025-06-03 11:13:11] [INFO ] Flatten gal took : 20 ms
[2025-06-03 11:13:11] [INFO ] Input system was already deterministic with 169 transitions.
Computed a total of 17 stabilizing places and 15 stable transitions
Graph (complete) has 377 edges and 129 vertex of which 124 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Graph (complete) has 377 edges and 129 vertex of which 124 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 124 transition count 154
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 114 transition count 154
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 33 place count 102 transition count 142
Iterating global reduction 0 with 12 rules applied. Total rules applied 45 place count 102 transition count 142
Applied a total of 45 rules in 60 ms. Remains 102 /129 variables (removed 27) and now considering 142/169 (removed 27) transitions.
// Phase 1: matrix 142 rows 102 cols
[2025-06-03 11:13:11] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:13:11] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-03 11:13:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:13:11] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:13:11] [INFO ] Implicit Places using invariants and state equation in 375 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 523 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 101/129 places, 142/169 transitions.
Applied a total of 0 rules in 22 ms. Remains 101 /101 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 606 ms. Remains : 101/129 places, 142/169 transitions.
[2025-06-03 11:13:11] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:13:11] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:13:11] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 232 steps (0 resets) in 9 ms. (23 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 11:13:12] [INFO ] Flatten gal took : 15 ms
[2025-06-03 11:13:12] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:13:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality403123986841399512.gal : 8 ms
[2025-06-03 11:13:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2771978954726516089.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality403123986841399512.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2771978954726516089.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Graph (complete) has 377 edges and 129 vertex of which 125 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 125 transition count 157
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 117 transition count 157
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 28 place count 106 transition count 146
Iterating global reduction 0 with 11 rules applied. Total rules applied 39 place count 106 transition count 146
Applied a total of 39 rules in 37 ms. Remains 106 /129 variables (removed 23) and now considering 146/169 (removed 23) transitions.
// Phase 1: matrix 146 rows 106 cols
[2025-06-03 11:13:12] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:13:12] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-03 11:13:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:13:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-03 11:13:12] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:13:12] [INFO ] Redundant transitions in 8 ms returned []
Running 145 sub problems to find dead transitions.
[2025-06-03 11:13:12] [INFO ] Invariant cache hit.
[2025-06-03 11:13:12] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/252 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 100/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/252 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 208 constraints, problems are : Problem set: 0 solved, 145 unsolved in 10574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/252 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 100/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 145/353 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 353 constraints, problems are : Problem set: 0 solved, 145 unsolved in 10792 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21401ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 21410ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/129 places, 146/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21759 ms. Remains : 106/129 places, 146/169 transitions.
[2025-06-03 11:13:33] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:13:33] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:13:33] [INFO ] Input system was already deterministic with 146 transitions.
[2025-06-03 11:13:34] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:13:34] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:13:34] [INFO ] Time to serialize gal into /tmp/CTLFireability18050903714984874145.gal : 3 ms
[2025-06-03 11:13:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9702882804688161959.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18050903714984874145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9702882804688161959.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.7764e+13,2.70532,64028,2,8433,5,385152,6,0,553,196433,0


Converting to forward existential form...Done !
original formula: EF(((!(E(!((((p113==1)&&(p142==1))||(p64==1))) U !(((EF(((p28==1)&&(p142==1))) * (p103==1)) * (p142==1))))) * EG(((((p118==0)||(p142==0))...253
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (!(E(!((((p113==1)&&(p142==1))||(p64==1))) U !(((E(TRUE U ((p28==1)&&(p142==1))) * (p103==1...329
Reverse transition relation is NOT exact ! Due to transitions t8, t32, t36, t38, t40, t42, t44, t46, t47, t49, t51, t53, t57, t130, t131, t132, t133, t134,...322
(forward)formula 0,0,10.5723,215036,1,0,202,1.06777e+06,314,137,3295,1.06271e+06,308
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 119 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 119 transition count 159
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 110 transition count 150
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 110 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 106 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 106 transition count 146
Applied a total of 46 rules in 21 ms. Remains 106 /129 variables (removed 23) and now considering 146/169 (removed 23) transitions.
// Phase 1: matrix 146 rows 106 cols
[2025-06-03 11:13:44] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:13:44] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-03 11:13:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:13:44] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:13:45] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2025-06-03 11:13:45] [INFO ] Invariant cache hit.
[2025-06-03 11:13:45] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/252 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 99/207 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/252 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 207 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8491 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/252 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 99/207 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 145/352 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 352 constraints, problems are : Problem set: 0 solved, 145 unsolved in 10900 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19422ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 19424ms
Starting structural reductions in LTL mode, iteration 1 : 106/129 places, 146/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19892 ms. Remains : 106/129 places, 146/169 transitions.
[2025-06-03 11:14:04] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:14:04] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:14:04] [INFO ] Input system was already deterministic with 146 transitions.
[2025-06-03 11:14:04] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:14:04] [INFO ] Flatten gal took : 13 ms
[2025-06-03 11:14:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11134473166970133576.gal : 5 ms
[2025-06-03 11:14:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10603695493609656062.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/CTLFireability11134473166970133576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10603695493609656062.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.97145e+13,9.24622,180684,2,22198,5,1.15075e+06,6,0,553,615913,0


Converting to forward existential form...Done !
original formula: (AF(EG(EF(((p43==1)&&(p142==1))))) + EX((AG(!(E((p16==1) U ((p109==1)&&(p141==1))))) + EG((E(((p109==1)&&(p141==1)) U ((p93==1)&&(p142==1...204
=> equivalent forward existential formula: [FwdG((Init * !(EX((!(E(TRUE U !(!(E((p16==1) U ((p109==1)&&(p141==1))))))) + EG((E(((p109==1)&&(p141==1)) U ((p...276
Reverse transition relation is NOT exact ! Due to transitions t9, t20, t29, t33, t35, t39, t41, t43, t45, t47, t48, t52, t54, t56, t58, t131, t132, t133, t...326
Detected timeout of ITS tools.
[2025-06-03 11:14:34] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:14:34] [INFO ] Applying decomposition
[2025-06-03 11:14:34] [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/graph3536003080267007457.txt' '-o' '/tmp/graph3536003080267007457.bin' '-w' '/tmp/graph3536003080267007457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3536003080267007457.bin' '-l' '-1' '-v' '-w' '/tmp/graph3536003080267007457.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:14:34] [INFO ] Decomposing Gal with order
[2025-06-03 11:14:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:14:34] [INFO ] Removed a total of 93 redundant transitions.
[2025-06-03 11:14:34] [INFO ] Flatten gal took : 70 ms
[2025-06-03 11:14:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 14 ms.
[2025-06-03 11:14:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17028961525703766669.gal : 5 ms
[2025-06-03 11:14:35] [INFO ] Time to serialize properties into /tmp/CTLFireability770211036326113892.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/CTLFireability17028961525703766669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability770211036326113892.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,5.97145e+13,2.27867,57416,472,213,72994,68307,245,257517,37,317286,0


Converting to forward existential form...Done !
original formula: (AF(EG(EF(((i4.u11.p43==1)&&(i4.u42.p142==1))))) + EX((AG(!(E((i1.u3.p16==1) U ((i11.u32.p109==1)&&(i0.u0.p141==1))))) + EG((E(((i11.u32....287
=> equivalent forward existential formula: [FwdG((Init * !(EX((!(E(TRUE U !(!(E((i1.u3.p16==1) U ((i11.u32.p109==1)&&(i0.u0.p141==1))))))) + EG((E(((i11.u3...359
Reverse transition relation is NOT exact ! Due to transitions t33, t35, t39, t41, t43, t45, t47, t48, t52, t54, t56, t58, i0.u0.t138, i1.u3.t137, i2.u6.t14...448
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,6.82199,126536,1,0,92459,68307,1570,929243,213,479778,67291
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 119 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 119 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 113 transition count 153
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 113 transition count 153
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 109 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 109 transition count 149
Applied a total of 40 rules in 8 ms. Remains 109 /129 variables (removed 20) and now considering 149/169 (removed 20) transitions.
// Phase 1: matrix 149 rows 109 cols
[2025-06-03 11:14:41] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:14:42] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-03 11:14:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:14:42] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-03 11:14:42] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2025-06-03 11:14:42] [INFO ] Invariant cache hit.
[2025-06-03 11:14:42] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/258 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 101/212 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 212 constraints, problems are : Problem set: 0 solved, 148 unsolved in 9617 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/258 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 101/212 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 148/360 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 360 constraints, problems are : Problem set: 0 solved, 148 unsolved in 10422 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20084ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 20086ms
Starting structural reductions in LTL mode, iteration 1 : 109/129 places, 149/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20478 ms. Remains : 109/129 places, 149/169 transitions.
[2025-06-03 11:15:02] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:15:02] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:15:02] [INFO ] Input system was already deterministic with 149 transitions.
[2025-06-03 11:15:02] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:15:02] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:15:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13484979460784405097.gal : 1 ms
[2025-06-03 11:15:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3868596515496451296.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/CTLFireability13484979460784405097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3868596515496451296.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,7.55783e+13,9.10028,171728,2,18947,5,1.08538e+06,6,0,568,584524,0


Converting to forward existential form...Done !
original formula: A(!((((((E(((p52==1)&&(p141==1)) U ((p2==1)&&(p141==1))) + AG(((p85==1)&&(p141==1)))) + AG(((p104==1)&&(p142==1)))) * EG((p103==1))) * ((...242
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(E(TRUE U !(EX(((p38==1)||(p104==1))))))))))) * !(E(!(EX(!(E(TRUE U !(EX(((p38==1)||(p104==...445
Reverse transition relation is NOT exact ! Due to transitions t7, t27, t34, t36, t38, t40, t44, t46, t49, t51, t53, t55, t59, t122, t125, t127, t134, t135,...334
Detected timeout of ITS tools.
[2025-06-03 11:15:32] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:15:32] [INFO ] Applying decomposition
[2025-06-03 11:15:32] [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/graph9842550803297271701.txt' '-o' '/tmp/graph9842550803297271701.bin' '-w' '/tmp/graph9842550803297271701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9842550803297271701.bin' '-l' '-1' '-v' '-w' '/tmp/graph9842550803297271701.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:15:32] [INFO ] Decomposing Gal with order
[2025-06-03 11:15:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:15:32] [INFO ] Removed a total of 97 redundant transitions.
[2025-06-03 11:15:32] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:15:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 10 ms.
[2025-06-03 11:15:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2305537895208064214.gal : 4 ms
[2025-06-03 11:15:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2855758542096116634.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/CTLFireability2305537895208064214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2855758542096116634.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,7.55783e+13,0.521166,18432,611,91,30816,2552,274,62176,30,13752,0


Converting to forward existential form...Done !
original formula: A(!((((((E(((i6.i0.u19.p52==1)&&(i4.u0.p141==1)) U ((i0.u1.p2==1)&&(i4.u0.p141==1))) + AG(((i9.u29.p85==1)&&(i4.u0.p141==1)))) + AG(((i11...344
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(E(TRUE U !(EX(((i4.u15.p38==1)||(i11.u35.p104==1))))))))))) * !(E(!(EX(!(E(TRUE U !(EX(((i...577
Reverse transition relation is NOT exact ! Due to transitions t34, t36, t38, t40, t44, t46, t49, t51, t53, t55, t59, t122, t125, t127, i0.u3.t141, i1.t27, ...452
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,11.1053,201524,1,0,340621,3479,1527,874443,150,31802,273503
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-03 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 : 129/129 places, 169/169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 119 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 119 transition count 159
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 111 transition count 151
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 111 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 108 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 108 transition count 148
Applied a total of 42 rules in 9 ms. Remains 108 /129 variables (removed 21) and now considering 148/169 (removed 21) transitions.
// Phase 1: matrix 148 rows 108 cols
[2025-06-03 11:15:43] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:15:43] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-03 11:15:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:15:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-03 11:15:44] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-03 11:15:44] [INFO ] Invariant cache hit.
[2025-06-03 11:15:44] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/256 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 100/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 210 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6214 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/256 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 100/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 147/357 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 357 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6995 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13234ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 13234ms
Starting structural reductions in LTL mode, iteration 1 : 108/129 places, 148/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13529 ms. Remains : 108/129 places, 148/169 transitions.
[2025-06-03 11:15:57] [INFO ] Flatten gal took : 7 ms
[2025-06-03 11:15:57] [INFO ] Flatten gal took : 6 ms
[2025-06-03 11:15:57] [INFO ] Input system was already deterministic with 148 transitions.
[2025-06-03 11:15:57] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:15:57] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:15:57] [INFO ] Time to serialize gal into /tmp/CTLFireability9666363831872651423.gal : 2 ms
[2025-06-03 11:15:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5459412192331113161.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/CTLFireability9666363831872651423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5459412192331113161.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.70815e+13,7.46649,147928,2,18330,5,978154,6,0,562,496372,0


Converting to forward existential form...Done !
original formula: AX(((AG(((p133==0)||(p142==0))) * (p8==0)) * (AX(E(!(((p104==1)&&(p142==1))) U E(((p94==1)&&(p142==1)) U ((p24==1)&&(p142==1))))) * (EF(E...265
=> equivalent forward existential formula: (([(FwdU(EY(Init),TRUE) * !(((p133==0)||(p142==0))))] = FALSE * [(EY(Init) * !((p8==0)))] = FALSE) * ([(EY(EY(In...412
Reverse transition relation is NOT exact ! Due to transitions t1, t29, t35, t37, t39, t41, t43, t45, t47, t50, t52, t54, t56, t58, t132, t133, t134, t135, ...327
Detected timeout of ITS tools.
[2025-06-03 11:16:27] [INFO ] Flatten gal took : 6 ms
[2025-06-03 11:16:27] [INFO ] Applying decomposition
[2025-06-03 11:16:27] [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/graph15016548965524446222.txt' '-o' '/tmp/graph15016548965524446222.bin' '-w' '/tmp/graph15016548965524446222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15016548965524446222.bin' '-l' '-1' '-v' '-w' '/tmp/graph15016548965524446222.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:16:27] [INFO ] Decomposing Gal with order
[2025-06-03 11:16:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:16:27] [INFO ] Removed a total of 94 redundant transitions.
[2025-06-03 11:16:27] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:16:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 7 ms.
[2025-06-03 11:16:27] [INFO ] Time to serialize gal into /tmp/CTLFireability9574710114060797237.gal : 4 ms
[2025-06-03 11:16:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11822803873596204058.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/CTLFireability9574710114060797237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11822803873596204058.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.70815e+13,0.223767,11064,238,82,13779,4480,272,27377,36,18890,0


Converting to forward existential form...Done !
original formula: AX(((AG(((i13.u39.p133==0)||(i13.u43.p142==0))) * (i0.u1.p8==0)) * (AX(E(!(((i10.u30.p104==1)&&(i13.u43.p142==1))) U E(((i9.u27.p94==1)&&...394
=> equivalent forward existential formula: (([(FwdU(EY(Init),TRUE) * !(((i13.u39.p133==0)||(i13.u43.p142==0))))] = FALSE * [(EY(Init) * !((i0.u1.p8==0)))] ...541
Reverse transition relation is NOT exact ! Due to transitions t35, t37, t39, t41, t43, t45, t47, t50, t52, t54, t56, t58, i0.u0.t139, i1.u3.t138, i2.i0.u5....457
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,8.39664,192828,1,0,189826,16563,1769,1.4896e+06,211,419464,120362
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Graph (complete) has 377 edges and 129 vertex of which 124 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 139 edges and 121 vertex of which 98 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Graph (trivial) has 108 edges and 98 vertex of which 54 / 98 are part of one of the 27 SCC in 3 ms
Free SCC test removed 27 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 71 transition count 127
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 58 place count 58 transition count 100
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 70 place count 46 transition count 76
Iterating global reduction 2 with 12 rules applied. Total rules applied 82 place count 46 transition count 76
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 34 transition count 52
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 34 transition count 52
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 118 place count 22 transition count 28
Iterating global reduction 2 with 12 rules applied. Total rules applied 130 place count 22 transition count 28
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 142 place count 10 transition count 16
Iterating global reduction 2 with 12 rules applied. Total rules applied 154 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 10 transition count 15
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 157 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 7 transition count 12
Applied a total of 159 rules in 34 ms. Remains 7 /129 variables (removed 122) and now considering 12/169 (removed 157) transitions.
[2025-06-03 11:16:35] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2025-06-03 11:16:35] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:16:35] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-03 11:16:35] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2025-06-03 11:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:16:36] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:16:36] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 11:16:36] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2025-06-03 11:16:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 120 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 117 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 246ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/129 places, 12/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 335 ms. Remains : 7/129 places, 12/169 transitions.
[2025-06-03 11:16:36] [INFO ] Flatten gal took : 0 ms
[2025-06-03 11:16:36] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:16:36] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 11:16:36] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:16:36] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:16:36] [INFO ] Time to serialize gal into /tmp/CTLFireability6107793349469829747.gal : 1 ms
[2025-06-03 11:16:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16278745637645234793.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/CTLFireability6107793349469829747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16278745637645234793.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,630,0.003966,3788,2,25,5,174,6,0,35,171,0


Converting to forward existential form...Done !
original formula: (E((p116!=1) U (p114==1)) + EF((p114==1)))
=> equivalent forward existential formula: ([(FwdU(Init,(p116!=1)) * (p114==1))] != FALSE + [(FwdU(Init,TRUE) * (p114==1))] != FALSE)
Hit Full ! (commute/partial/dont) 9/0/3
(forward)formula 0,1,0.005983,3916,1,0,8,174,15,2,95,171,4
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-05 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 : 129/129 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 118 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 118 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 111 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 111 transition count 151
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 109 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 109 transition count 149
Applied a total of 40 rules in 10 ms. Remains 109 /129 variables (removed 20) and now considering 149/169 (removed 20) transitions.
// Phase 1: matrix 149 rows 109 cols
[2025-06-03 11:16:36] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:16:36] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-03 11:16:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:16:36] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-03 11:16:36] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2025-06-03 11:16:36] [INFO ] Invariant cache hit.
[2025-06-03 11:16:36] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/258 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 100/211 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 211 constraints, problems are : Problem set: 0 solved, 148 unsolved in 7360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/258 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 100/211 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 148/359 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 359 constraints, problems are : Problem set: 0 solved, 148 unsolved in 7180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14558ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 14559ms
Starting structural reductions in LTL mode, iteration 1 : 109/129 places, 149/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14859 ms. Remains : 109/129 places, 149/169 transitions.
[2025-06-03 11:16:51] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:16:51] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:16:51] [INFO ] Input system was already deterministic with 149 transitions.
[2025-06-03 11:16:51] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:16:51] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:16:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3793723963903484009.gal : 1 ms
[2025-06-03 11:16:51] [INFO ] Time to serialize properties into /tmp/CTLFireability565607343668882004.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/CTLFireability3793723963903484009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability565607343668882004.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.
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,7.68937e+13,16.1049,292652,2,51654,5,1.87162e+06,6,0,568,1.0384e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 11:17:21] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:17:21] [INFO ] Applying decomposition
[2025-06-03 11:17:21] [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/graph16754482307665033028.txt' '-o' '/tmp/graph16754482307665033028.bin' '-w' '/tmp/graph16754482307665033028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16754482307665033028.bin' '-l' '-1' '-v' '-w' '/tmp/graph16754482307665033028.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:17:21] [INFO ] Decomposing Gal with order
[2025-06-03 11:17:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:17:21] [INFO ] Removed a total of 96 redundant transitions.
[2025-06-03 11:17:21] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:17:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 5 ms.
[2025-06-03 11:17:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9129566949973537780.gal : 4 ms
[2025-06-03 11:17:21] [INFO ] Time to serialize properties into /tmp/CTLFireability553140968218952032.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/CTLFireability9129566949973537780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability553140968218952032.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,7.68937e+13,5.3464,123968,1472,252,175586,6794,265,793395,33,125319,0


Converting to forward existential form...Done !
original formula: AX(E(EG(!(((((i7.u24.p80==1)&&(i10.u44.p141==1))&&((i10.u31.p102==1)&&(i10.u44.p141==1)))&&(((i8.u26.p86==1)&&(i3.u12.p38==1))&&(i14.u45....388
=> equivalent forward existential formula: [(EY(Init) * !(E(EG(!(((((i7.u24.p80==1)&&(i10.u44.p141==1))&&((i10.u31.p102==1)&&(i10.u44.p141==1)))&&(((i8.u26...612
Reverse transition relation is NOT exact ! Due to transitions t35, t37, t39, t43, t45, t47, t49, t52, t56, t60, t126, i0.u1.t141, i1.u4.t140, i2.u8.t143, i...469
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 157
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 111 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 111 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 108 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 108 transition count 148
Applied a total of 42 rules in 9 ms. Remains 108 /129 variables (removed 21) and now considering 148/169 (removed 21) transitions.
// Phase 1: matrix 148 rows 108 cols
[2025-06-03 11:17:51] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:17:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-03 11:17:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:17:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-03 11:17:51] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-03 11:17:51] [INFO ] Invariant cache hit.
[2025-06-03 11:17:51] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/256 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 100/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 210 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6855 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/256 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 100/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 147/357 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 357 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13761ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 13762ms
Starting structural reductions in LTL mode, iteration 1 : 108/129 places, 148/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14073 ms. Remains : 108/129 places, 148/169 transitions.
[2025-06-03 11:18:05] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:18:05] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:18:05] [INFO ] Input system was already deterministic with 148 transitions.
[2025-06-03 11:18:05] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:18:05] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:18:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17191202214255057218.gal : 2 ms
[2025-06-03 11:18:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13650916458283725399.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/CTLFireability17191202214255057218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13650916458283725399.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.
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,7.0417e+13,7.91983,167724,2,21281,5,1.02173e+06,6,0,563,609997,0


Converting to forward existential form...Done !
original formula: AF(((AG((p44==1)) + (((p22==1)&&(p141==1))&&((p15==0)||(p141==0)))) + ((AG((((p50==0)||(p141==0))||(p106==0))) * EX(((p0==1)||((p64==0)&&...238
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((p44==1)))) + (((p22==1)&&(p141==1))&&((p15==0)||(p141==0)))) + ((!(E(TRUE U !((((p5...313
Reverse transition relation is NOT exact ! Due to transitions t17, t22, t30, t34, t36, t38, t40, t46, t48, t51, t53, t55, t57, t59, t125, t126, t133, t134,...334
Detected timeout of ITS tools.
[2025-06-03 11:18:35] [INFO ] Flatten gal took : 6 ms
[2025-06-03 11:18:35] [INFO ] Applying decomposition
[2025-06-03 11:18:35] [INFO ] Flatten gal took : 4 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/graph12050829948094051172.txt' '-o' '/tmp/graph12050829948094051172.bin' '-w' '/tmp/graph12050829948094051172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12050829948094051172.bin' '-l' '-1' '-v' '-w' '/tmp/graph12050829948094051172.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:18:35] [INFO ] Decomposing Gal with order
[2025-06-03 11:18:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:18:35] [INFO ] Removed a total of 96 redundant transitions.
[2025-06-03 11:18:35] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:18:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 5 ms.
[2025-06-03 11:18:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13763685736210690725.gal : 3 ms
[2025-06-03 11:18:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11169566059205786126.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/CTLFireability13763685736210690725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11169566059205786126.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,7.0417e+13,1.26669,35688,944,139,64742,2455,282,109110,32,14273,0


Converting to forward existential form...Done !
original formula: AF(((AG((i5.u16.p44==1)) + (((i3.i0.u8.p22==1)&&(i8.u0.p141==1))&&((i2.u5.p15==0)||(i8.u0.p141==0)))) + ((AG((((i5.u18.p50==0)||(i8.u0.p1...349
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((i5.u16.p44==1)))) + (((i3.i0.u8.p22==1)&&(i8.u0.p141==1))&&((i2.u5.p15==0)||(i8.u0....424
Reverse transition relation is NOT exact ! Due to transitions t34, t36, t38, t40, t46, t48, t51, t53, t55, t57, t59, t125, t126, i0.t30, i0.u12.t17, i0.u12...460
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Graph (complete) has 377 edges and 129 vertex of which 124 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 124 transition count 156
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 116 transition count 156
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 27 place count 106 transition count 146
Iterating global reduction 0 with 10 rules applied. Total rules applied 37 place count 106 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 39 place count 105 transition count 145
Applied a total of 39 rules in 22 ms. Remains 105 /129 variables (removed 24) and now considering 145/169 (removed 24) transitions.
// Phase 1: matrix 145 rows 105 cols
[2025-06-03 11:19:05] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:19:05] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-03 11:19:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:19:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-03 11:19:05] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:19:05] [INFO ] Redundant transitions in 5 ms returned []
Running 144 sub problems to find dead transitions.
[2025-06-03 11:19:06] [INFO ] Invariant cache hit.
[2025-06-03 11:19:06] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/250 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 100/207 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 207 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6912 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/250 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 100/207 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 144/351 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/250 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 351 constraints, problems are : Problem set: 0 solved, 144 unsolved in 7004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13934ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 13935ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/129 places, 145/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14269 ms. Remains : 105/129 places, 145/169 transitions.
[2025-06-03 11:19:19] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:19:19] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:19:19] [INFO ] Input system was already deterministic with 145 transitions.
[2025-06-03 11:19:19] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:19:19] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:19:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16053273819054964838.gal : 2 ms
[2025-06-03 11:19:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1005398194037766038.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/CTLFireability16053273819054964838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1005398194037766038.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.61491e+13,2.20903,52540,2,3584,5,326040,6,0,549,154748,0


Converting to forward existential form...Done !
original formula: EF(((p114==1) + ((AG((((p66==0)&&((p16==0)||(p141==0)))&&((p2==0)||(p141==0)))) * (p56==0)) * ((p43==1)&&((p108==0)||(p142==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p114==1))] != FALSE + [(((FwdU(Init,TRUE) * ((p43==1)&&((p108==0)||(p142==0)))) * (p56==0)...244
(forward)formula 0,1,2.21044,52540,1,0,7,326040,8,1,552,154748,1
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 157
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 110 transition count 150
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 110 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 108 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 108 transition count 148
Applied a total of 42 rules in 8 ms. Remains 108 /129 variables (removed 21) and now considering 148/169 (removed 21) transitions.
// Phase 1: matrix 148 rows 108 cols
[2025-06-03 11:19:22] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:19:22] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-03 11:19:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:19:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-03 11:19:22] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-03 11:19:22] [INFO ] Invariant cache hit.
[2025-06-03 11:19:22] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/256 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 100/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 210 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6532 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/256 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 100/210 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 147/357 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 357 constraints, problems are : Problem set: 0 solved, 147 unsolved in 7303 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13856ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 13857ms
Starting structural reductions in LTL mode, iteration 1 : 108/129 places, 148/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14193 ms. Remains : 108/129 places, 148/169 transitions.
[2025-06-03 11:19:36] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:19:36] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:19:36] [INFO ] Input system was already deterministic with 148 transitions.
[2025-06-03 11:19:36] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:19:36] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:19:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8373502692564806315.gal : 2 ms
[2025-06-03 11:19:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1797352242658552237.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/CTLFireability8373502692564806315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1797352242658552237.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,7.0417e+13,11.9233,218220,2,37838,5,1.2996e+06,6,0,563,824695,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 11:20:06] [INFO ] Flatten gal took : 6 ms
[2025-06-03 11:20:06] [INFO ] Applying decomposition
[2025-06-03 11:20:06] [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/graph7226137982206210709.txt' '-o' '/tmp/graph7226137982206210709.bin' '-w' '/tmp/graph7226137982206210709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7226137982206210709.bin' '-l' '-1' '-v' '-w' '/tmp/graph7226137982206210709.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:20:06] [INFO ] Decomposing Gal with order
[2025-06-03 11:20:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:20:06] [INFO ] Removed a total of 96 redundant transitions.
[2025-06-03 11:20:06] [INFO ] Flatten gal took : 11 ms
[2025-06-03 11:20:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 4 ms.
[2025-06-03 11:20:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13500115756111983675.gal : 3 ms
[2025-06-03 11:20:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17291842028361551353.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/CTLFireability13500115756111983675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17291842028361551353.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,7.0417e+13,1.3607,35384,881,173,64148,3447,265,114981,32,19440,0


Converting to forward existential form...Done !
original formula: EF(((E(((i11.u33.p104==1)&&(i0.u2.p142==1)) U EG((!(((i12.u36.p112==1)&&(i4.u0.p141==1))) * A(((i2.u6.p15==1)&&(i4.u0.p141==1)) U (i4.u12...352
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (E(((i11.u33.p104==1)&&(i0.u2.p142==1)) U EG((!(((i12.u36.p112==1)&&(i4.u0.p141==1))) * !((...469
Reverse transition relation is NOT exact ! Due to transitions t34, t38, t40, t44, t46, t48, t49, t51, t55, t57, t59, t119, t126, i0.t30, i0.u1.t16, i0.u1.t...455
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,25.8652,420144,1,0,636783,12669,1597,2.14978e+06,170,135043,512774
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Graph (complete) has 377 edges and 129 vertex of which 124 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 139 edges and 121 vertex of which 99 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Graph (trivial) has 112 edges and 99 vertex of which 56 / 99 are part of one of the 28 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 71 transition count 127
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 61 place count 57 transition count 99
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 45 transition count 75
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 45 transition count 75
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 97 place count 33 transition count 51
Iterating global reduction 2 with 12 rules applied. Total rules applied 109 place count 33 transition count 51
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 121 place count 21 transition count 27
Iterating global reduction 2 with 12 rules applied. Total rules applied 133 place count 21 transition count 27
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 145 place count 9 transition count 15
Iterating global reduction 2 with 12 rules applied. Total rules applied 157 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 9 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 6 transition count 11
Applied a total of 162 rules in 16 ms. Remains 6 /129 variables (removed 123) and now considering 11/169 (removed 158) transitions.
[2025-06-03 11:20:32] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2025-06-03 11:20:32] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:20:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 11:20:32] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2025-06-03 11:20:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:20:32] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:20:32] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 11:20:32] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2025-06-03 11:20:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 100 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 96 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 201ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/129 places, 11/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 279 ms. Remains : 6/129 places, 11/169 transitions.
[2025-06-03 11:20:32] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:20:32] [INFO ] Flatten gal took : 0 ms
[2025-06-03 11:20:32] [INFO ] Input system was already deterministic with 11 transitions.
[2025-06-03 11:20:32] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:20:32] [INFO ] Flatten gal took : 0 ms
[2025-06-03 11:20:32] [INFO ] Time to serialize gal into /tmp/CTLFireability8012528886754742029.gal : 0 ms
[2025-06-03 11:20:32] [INFO ] Time to serialize properties into /tmp/CTLFireability17814782108632631165.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/CTLFireability8012528886754742029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17814782108632631165.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,525,0.005323,3788,2,23,5,175,6,0,29,164,0


Converting to forward existential form...Done !
original formula: AG(EF((p3!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p3!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...171
(forward)formula 0,1,0.01067,3916,1,0,26,655,39,13,167,733,31
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 160
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 160
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 114 transition count 154
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 114 transition count 154
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 110 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 110 transition count 150
Applied a total of 38 rules in 3 ms. Remains 110 /129 variables (removed 19) and now considering 150/169 (removed 19) transitions.
// Phase 1: matrix 150 rows 110 cols
[2025-06-03 11:20:32] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:20:32] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-03 11:20:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:20:33] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-03 11:20:33] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-06-03 11:20:33] [INFO ] Invariant cache hit.
[2025-06-03 11:20:33] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/260 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 101/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 213 constraints, problems are : Problem set: 0 solved, 149 unsolved in 6609 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/260 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 101/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 149/362 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 362 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7528 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14151ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 14152ms
Starting structural reductions in LTL mode, iteration 1 : 110/129 places, 150/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14447 ms. Remains : 110/129 places, 150/169 transitions.
[2025-06-03 11:20:47] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:20:47] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:20:47] [INFO ] Input system was already deterministic with 150 transitions.
[2025-06-03 11:20:47] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:20:47] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:20:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5200144867268587937.gal : 0 ms
[2025-06-03 11:20:47] [INFO ] Time to serialize properties into /tmp/CTLFireability18177316488923992587.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/CTLFireability5200144867268587937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18177316488923992587.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,8.25912e+13,10.3254,215540,2,30774,5,1.31352e+06,6,0,573,807607,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 11:21:17] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:21:17] [INFO ] Applying decomposition
[2025-06-03 11:21:17] [INFO ] Flatten gal took : 4 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/graph15554310539498432444.txt' '-o' '/tmp/graph15554310539498432444.bin' '-w' '/tmp/graph15554310539498432444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15554310539498432444.bin' '-l' '-1' '-v' '-w' '/tmp/graph15554310539498432444.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:21:17] [INFO ] Decomposing Gal with order
[2025-06-03 11:21:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:21:17] [INFO ] Removed a total of 97 redundant transitions.
[2025-06-03 11:21:17] [INFO ] Flatten gal took : 11 ms
[2025-06-03 11:21:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 5 ms.
[2025-06-03 11:21:17] [INFO ] Time to serialize gal into /tmp/CTLFireability2428548542563237573.gal : 2 ms
[2025-06-03 11:21:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12113481490756880482.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/CTLFireability2428548542563237573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12113481490756880482.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.25912e+13,0.633565,19424,764,127,27457,3508,285,64990,32,21831,0


Converting to forward existential form...Done !
original formula: EG(EF(((EX(((i6.u19.p52==1)&&(i2.u0.p141==1))) * (i0.u15.p73==1)) * ((i0.u1.p142==1)&&((i0.u15.p43==1)||((i4.i0.u11.p32==1)&&(i2.u0.p141=...164
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((EX(((i6.u19.p52==1)&&(i2.u0.p141==1))) * (i0.u15.p73==1)) * ((i0.u1.p142==1)&&((i0.u15.p43...213
Reverse transition relation is NOT exact ! Due to transitions t35, t37, t39, t47, t49, t50, t54, t56, t58, t60, t123, t125, t128, i0.t31, i0.u15.t13, i0.u1...460
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
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,16.7832,262172,1,0,508432,21266,1542,899939,170,127221,301240
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 157
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 157
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 108 transition count 148
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 108 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 105 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 105 transition count 145
Applied a total of 48 rules in 4 ms. Remains 105 /129 variables (removed 24) and now considering 145/169 (removed 24) transitions.
// Phase 1: matrix 145 rows 105 cols
[2025-06-03 11:21:34] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:21:34] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-03 11:21:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:21:34] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:21:34] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-03 11:21:34] [INFO ] Invariant cache hit.
[2025-06-03 11:21:34] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/250 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 99/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 206 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6568 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/250 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 99/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 144/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 350 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6952 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13537ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 13538ms
Starting structural reductions in LTL mode, iteration 1 : 105/129 places, 145/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13835 ms. Remains : 105/129 places, 145/169 transitions.
[2025-06-03 11:21:48] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:21:48] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:21:48] [INFO ] Input system was already deterministic with 145 transitions.
[2025-06-03 11:21:48] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:21:48] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:21:48] [INFO ] Time to serialize gal into /tmp/CTLFireability381306907422355183.gal : 1 ms
[2025-06-03 11:21:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7376251339640090483.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/CTLFireability381306907422355183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7376251339640090483.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.43721e+13,9.36268,172120,2,20357,5,1.11582e+06,6,0,548,567083,0


Converting to forward existential form...Done !
original formula: AG(((AG((EG(((p8==0)||(p142==0))) * EF((p113==1)))) + A((((p26!=1) * AX(((p27==1)&&(p141==1)))) + ((p125==1)&&(p141==1))) U AX(!(((p126==...280
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !(((!((E(!(E(TRUE U ((p115==1)&&(p141==1)))) U (!((!(E(TRUE U !(((p115==1)&&(p141==1...1059
Reverse transition relation is NOT exact ! Due to transitions t5, t28, t32, t36, t38, t40, t42, t44, t46, t47, t49, t51, t53, t55, t57, t130, t131, t132, t...326
Detected timeout of ITS tools.
[2025-06-03 11:22:18] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:22:18] [INFO ] Applying decomposition
[2025-06-03 11:22:18] [INFO ] Flatten gal took : 4 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/graph756179826471720920.txt' '-o' '/tmp/graph756179826471720920.bin' '-w' '/tmp/graph756179826471720920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph756179826471720920.bin' '-l' '-1' '-v' '-w' '/tmp/graph756179826471720920.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:22:18] [INFO ] Decomposing Gal with order
[2025-06-03 11:22:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:22:18] [INFO ] Removed a total of 93 redundant transitions.
[2025-06-03 11:22:18] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:22:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 5 ms.
[2025-06-03 11:22:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10579538459346987657.gal : 3 ms
[2025-06-03 11:22:18] [INFO ] Time to serialize properties into /tmp/CTLFireability2371164256201733806.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/CTLFireability10579538459346987657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2371164256201733806.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,5.43721e+13,0.485292,17428,300,106,18814,13964,250,50713,36,85217,0


Converting to forward existential form...Done !
original formula: AG(((AG((EG(((i1.u2.p8==0)||(i0.u0.p142==0))) * EF((i0.u33.p113==1)))) + A((((i3.u7.p26!=1) * AX(((i3.u7.p27==1)&&(i1.u1.p141==1)))) + ((...393
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !(((!((E(!(E(TRUE U ((i12.u34.p115==1)&&(i1.u1.p141==1)))) U (!((!(E(TRUE U !(((i12....1378
Reverse transition relation is NOT exact ! Due to transitions t32, t36, t38, t40, t42, t44, t46, t47, t49, t51, t53, t55, t57, i0.t28, i0.u33.t5, i0.u33.t1...442
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,18.8791,357740,1,0,327242,270429,1652,1.7671e+06,220,2.21671e+06,126694
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 157
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 157
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 108 transition count 148
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 108 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 105 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 105 transition count 145
Applied a total of 48 rules in 8 ms. Remains 105 /129 variables (removed 24) and now considering 145/169 (removed 24) transitions.
[2025-06-03 11:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:22:37] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-03 11:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:22:37] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:22:37] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 350 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/129 places, 145/169 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 359 ms. Remains : 104/129 places, 145/169 transitions.
[2025-06-03 11:22:37] [INFO ] Flatten gal took : 3 ms
[2025-06-03 11:22:37] [INFO ] Flatten gal took : 3 ms
[2025-06-03 11:22:37] [INFO ] Input system was already deterministic with 145 transitions.
[2025-06-03 11:22:37] [INFO ] Flatten gal took : 3 ms
[2025-06-03 11:22:37] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:22:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17215155286955146594.gal : 1 ms
[2025-06-03 11:22:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3676691534850702554.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/CTLFireability17215155286955146594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3676691534850702554.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 11:23:07] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:23:07] [INFO ] Applying decomposition
[2025-06-03 11:23:07] [INFO ] Flatten gal took : 3 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/graph17569770326954543878.txt' '-o' '/tmp/graph17569770326954543878.bin' '-w' '/tmp/graph17569770326954543878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17569770326954543878.bin' '-l' '-1' '-v' '-w' '/tmp/graph17569770326954543878.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:23:07] [INFO ] Decomposing Gal with order
[2025-06-03 11:23:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:23:07] [INFO ] Removed a total of 78 redundant transitions.
[2025-06-03 11:23:07] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:23:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 4 ms.
[2025-06-03 11:23:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17789636012623928457.gal : 2 ms
[2025-06-03 11:23:07] [INFO ] Time to serialize properties into /tmp/CTLFireability6280064705549106599.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/CTLFireability17789636012623928457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6280064705549106599.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,5.43721e+13,0.425798,18812,518,182,25263,9735,225,78902,48,52207,0


Converting to forward existential form...Done !
original formula: AX(EX((!(E((i12.u22.p113==1) U ((i9.u17.p90==1)&&(i1.u0.p141==1)))) * AG(EX((i14.u27.p136==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((!(E((i12.u22.p113==1) U ((i9.u17.p90==1)&&(i1.u0.p141==1)))) * !(E(TRUE U !(EX((i14.u27.p136=...175
Reverse transition relation is NOT exact ! Due to transitions t28, t32, t36, t38, t40, t44, t46, t47, t49, t51, t53, t55, u7.t135, i0.u12.t141, i1.u0.t137,...444
(forward)formula 0,0,3.29303,72700,1,0,101260,9735,1232,384240,250,57346,93727
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Graph (complete) has 377 edges and 129 vertex of which 126 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 126 transition count 158
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 118 transition count 158
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 26 place count 109 transition count 149
Iterating global reduction 0 with 9 rules applied. Total rules applied 35 place count 109 transition count 149
Applied a total of 35 rules in 17 ms. Remains 109 /129 variables (removed 20) and now considering 149/169 (removed 20) transitions.
// Phase 1: matrix 149 rows 109 cols
[2025-06-03 11:23:11] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:23:11] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-03 11:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:23:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-06-03 11:23:11] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:23:11] [INFO ] Redundant transitions in 6 ms returned []
Running 148 sub problems to find dead transitions.
[2025-06-03 11:23:11] [INFO ] Invariant cache hit.
[2025-06-03 11:23:11] [INFO ] State equation strengthened by 102 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/258 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 102/213 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 213 constraints, problems are : Problem set: 0 solved, 148 unsolved in 7324 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/258 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 102/213 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 148/361 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 361 constraints, problems are : Problem set: 0 solved, 148 unsolved in 7100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14435ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 14436ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/129 places, 149/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14753 ms. Remains : 109/129 places, 149/169 transitions.
[2025-06-03 11:23:25] [INFO ] Flatten gal took : 3 ms
[2025-06-03 11:23:25] [INFO ] Flatten gal took : 3 ms
[2025-06-03 11:23:25] [INFO ] Input system was already deterministic with 149 transitions.
[2025-06-03 11:23:25] [INFO ] Flatten gal took : 3 ms
[2025-06-03 11:23:25] [INFO ] Flatten gal took : 3 ms
[2025-06-03 11:23:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16373439724068792068.gal : 1 ms
[2025-06-03 11:23:25] [INFO ] Time to serialize properties into /tmp/CTLFireability1372512169431930019.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/CTLFireability16373439724068792068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1372512169431930019.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.2817e+13,2.11494,49484,2,4258,5,297694,6,0,567,144678,0


Converting to forward existential form...Done !
original formula: EG(EF(((((p72==0)||(p141==0))&&((p44==1)||(p103==1)))||((((p54==1)&&(p61==1))&&((p94==1)&&(p142==1)))&&(p11==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((p72==0)||(p141==0))&&((p44==1)||(p103==1)))||((((p54==1)&&(p61==1))&&((p94==1)&&(p142==1...182
Reverse transition relation is NOT exact ! Due to transitions t7, t32, t34, t36, t40, t42, t46, t47, t49, t53, t57, t119, t130, t131, t132, t133, t134, t13...324
Detected timeout of ITS tools.
[2025-06-03 11:23:55] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:23:55] [INFO ] Applying decomposition
[2025-06-03 11:23:55] [INFO ] Flatten gal took : 4 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/graph2035888610009967963.txt' '-o' '/tmp/graph2035888610009967963.bin' '-w' '/tmp/graph2035888610009967963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2035888610009967963.bin' '-l' '-1' '-v' '-w' '/tmp/graph2035888610009967963.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:23:55] [INFO ] Decomposing Gal with order
[2025-06-03 11:23:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:23:55] [INFO ] Removed a total of 95 redundant transitions.
[2025-06-03 11:23:55] [INFO ] Flatten gal took : 11 ms
[2025-06-03 11:23:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 3 ms.
[2025-06-03 11:23:55] [INFO ] Time to serialize gal into /tmp/CTLFireability17593123122682211971.gal : 3 ms
[2025-06-03 11:23:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10526815645441950462.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/CTLFireability17593123122682211971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10526815645441950462.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,2.2817e+13,0.102464,7156,375,102,5891,519,290,14486,36,4595,0


Converting to forward existential form...Done !
original formula: EG(EF(((((i7.u23.p72==0)||(i0.i0.u1.p141==0))&&((i4.u13.p44==1)||(i1.u0.p103==1)))||((((i5.u16.p54==1)&&(i6.i0.u19.p61==1))&&((i9.u30.p94...201
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((i7.u23.p72==0)||(i0.i0.u1.p141==0))&&((i4.u13.p44==1)||(i1.u0.p103==1)))||((((i5.u16.p54...250
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t40, t42, t46, t49, t53, t57, t94, t124, i0.i0.u1.t138, i0.i1.u3.t137, i0.i2.u...458
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,6.35867,122612,1,0,270487,1664,1571,386939,175,15952,191967
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 169/169 transitions.
Graph (complete) has 377 edges and 129 vertex of which 124 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 124 transition count 155
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 115 transition count 155
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 31 place count 103 transition count 143
Iterating global reduction 0 with 12 rules applied. Total rules applied 43 place count 103 transition count 143
Applied a total of 43 rules in 16 ms. Remains 103 /129 variables (removed 26) and now considering 143/169 (removed 26) transitions.
// Phase 1: matrix 143 rows 103 cols
[2025-06-03 11:24:02] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:24:02] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-03 11:24:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:24:02] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:24:02] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:24:02] [INFO ] Redundant transitions in 2 ms returned []
Running 142 sub problems to find dead transitions.
[2025-06-03 11:24:02] [INFO ] Invariant cache hit.
[2025-06-03 11:24:02] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 204 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6404 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 142/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 346 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6658 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13075ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 13076ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/129 places, 143/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13418 ms. Remains : 103/129 places, 143/169 transitions.
[2025-06-03 11:24:15] [INFO ] Flatten gal took : 3 ms
[2025-06-03 11:24:15] [INFO ] Flatten gal took : 2 ms
[2025-06-03 11:24:15] [INFO ] Input system was already deterministic with 143 transitions.
RANDOM walk for 1127 steps (5 resets) in 10 ms. (102 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 11:24:15] [INFO ] Flatten gal took : 3 ms
[2025-06-03 11:24:15] [INFO ] Flatten gal took : 2 ms
[2025-06-03 11:24:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3847332664428397161.gal : 1 ms
[2025-06-03 11:24:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11469581098311795270.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3847332664428397161.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11469581098311795270.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 11:24:15] [INFO ] Flatten gal took : 4 ms
[2025-06-03 11:24:15] [INFO ] Flatten gal took : 3 ms
[2025-06-03 11:24:15] [INFO ] Applying decomposition
[2025-06-03 11:24:15] [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/graph9707601414102498666.txt' '-o' '/tmp/graph9707601414102498666.bin' '-w' '/tmp/graph9707601414102498666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9707601414102498666.bin' '-l' '-1' '-v' '-w' '/tmp/graph9707601414102498666.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:24:15] [INFO ] Decomposing Gal with order
[2025-06-03 11:24:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:24:15] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-03 11:24:15] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:24:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 3 ms.
[2025-06-03 11:24:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5292425437152989352.gal : 2 ms
[2025-06-03 11:24:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12788093939452641818.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/CTLFireability5292425437152989352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12788093939452641818.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 2 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.54874e+14,0.894724,27024,531,243,45101,5653,337,100945,47,41824,0


Converting to forward existential form...Done !
original formula: AX(E(EG(!(((((i7.u31.p80==1)&&(i4.u52.p141==1))&&((i10.u38.p102==1)&&(i4.u52.p141==1)))&&(((i8.u33.p86==1)&&(i3.u15.p38==1))&&(i12.u16.p1...386
=> equivalent forward existential formula: [(EY(Init) * !(E(EG(!(((((i7.u31.p80==1)&&(i4.u52.p141==1))&&((i10.u38.p102==1)&&(i4.u52.p141==1)))&&(((i8.u33.p...614
Reverse transition relation is NOT exact ! Due to transitions t64, t131, t133, t135, t139, t142, t147, i0.i1.u2.t159, i1.u4.t158, i1.u6.t157, i2.u8.t161, i...522
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,58.2423,981876,1,0,1.75766e+06,29407,1895,3.73533e+06,230,283882,1021466
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((AG((i4.u17.p44==1)) + (((i2.u8.p22==1)&&(i4.u52.p141==1))&&((i1.u5.p15==0)||(i4.u52.p141==0)))) + ((AG((((i4.u19.p50==0)||(i4.u52.p1...356
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((i4.u17.p44==1)))) + (((i2.u8.p22==1)&&(i4.u52.p141==1))&&((i1.u5.p15==0)||(i4.u52.p...431
(forward)formula 1,0,84.1107,1322740,1,0,2.4386e+06,32433,1989,4.80788e+06,236,346485,1367159
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 780184 ms.

BK_STOP 1748949940445

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-14a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-14a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854064700738"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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