Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631133100645.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is DoubleLock-PT-p3s3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631133100645
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716420422223

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 23:27:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:27:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:27:03] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-22 23:27:03] [INFO ] Transformed 306 places.
[2024-05-22 23:27:03] [INFO ] Transformed 3136 transitions.
[2024-05-22 23:27:03] [INFO ] Parsed PT model containing 306 places and 3136 transitions and 12672 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 68 places in 13 ms
Reduce places removed 68 places and 128 transitions.
FORMULA DoubleLock-PT-p3s3-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-22 23:27:03] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 238 cols
[2024-05-22 23:27:03] [INFO ] Computed 4 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1, 1, 1, +inf, 1, 10, 1, 1]
RANDOM walk for 10007 steps (95 resets) in 52 ms. (188 steps per ms)
FORMULA DoubleLock-PT-p3s3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (80 resets) in 84 ms. (588 steps per ms)
FORMULA DoubleLock-PT-p3s3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[4, 9, 0] Max Struct:[+inf, +inf, 1]
[2024-05-22 23:27:04] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2024-05-22 23:27:04] [INFO ] Invariant cache hit.
[2024-05-22 23:27:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 23:27:04] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 23:27:04] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2024-05-22 23:27:04] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-22 23:27:04] [INFO ] [Real]Added 143 Read/Feed constraints in 109 ms returned sat
[2024-05-22 23:27:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:27:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-22 23:27:04] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 23:27:05] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2024-05-22 23:27:05] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 23:27:06] [INFO ] [Nat]Added 143 Read/Feed constraints in 1001 ms returned sat
[2024-05-22 23:27:06] [INFO ] Deduced a trap composed of 95 places in 354 ms of which 19 ms to minimize.
[2024-05-22 23:27:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2024-05-22 23:27:07] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 291 ms.
[2024-05-22 23:27:07] [INFO ] Added : 4 causal constraints over 2 iterations in 673 ms. Result :sat
Minimization took 565 ms.
[2024-05-22 23:27:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-22 23:27:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 23:27:08] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-05-22 23:27:08] [INFO ] [Real]Added 143 Read/Feed constraints in 166 ms returned sat
[2024-05-22 23:27:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:27:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-22 23:27:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 23:27:09] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2024-05-22 23:27:09] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 23:27:10] [INFO ] [Nat]Added 143 Read/Feed constraints in 1036 ms returned unknown
[2024-05-22 23:27:10] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 23:27:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 23:27:10] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-05-22 23:27:10] [INFO ] [Real]Added 143 Read/Feed constraints in 35 ms returned sat
[2024-05-22 23:27:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:27:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 23:27:10] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 23:27:10] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-05-22 23:27:11] [INFO ] [Nat]Added 143 Read/Feed constraints in 106 ms returned sat
[2024-05-22 23:27:11] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 183 ms.
[2024-05-22 23:27:11] [INFO ] Added : 0 causal constraints over 0 iterations in 323 ms. Result :sat
Minimization took 558 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 9, 0] Max Struct:[+inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 9, 0] Max Struct:[+inf, +inf, 1]
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 3008/3008 transitions.
Graph (complete) has 5131 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 235 transition count 2976
Applied a total of 33 rules in 152 ms. Remains 235 /238 variables (removed 3) and now considering 2976/3008 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 235/238 places, 2976/3008 transitions.
[2024-05-22 23:27:12] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1180=1, 1992=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1162=1, 1974=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 150 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :[3, 6, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 9, 1] Max Struct:[+inf, +inf, 1]
[2024-05-22 23:27:12] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2024-05-22 23:27:12] [INFO ] Computed 3 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 9, 1] Max Struct:[+inf, +inf, 1]
FORMULA DoubleLock-PT-p3s3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000002 steps (9527 resets) in 1957 ms. (510 steps per ms)
BEST_FIRST walk for 2000002 steps (2972 resets) in 1265 ms. (1579 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 15] Max Struct:[+inf, +inf]
[2024-05-22 23:27:16] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
[2024-05-22 23:27:16] [INFO ] Invariant cache hit.
[2024-05-22 23:27:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 23:27:16] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-05-22 23:27:16] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-22 23:27:16] [INFO ] [Real]Added 143 Read/Feed constraints in 168 ms returned sat
[2024-05-22 23:27:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:27:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 23:27:17] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-05-22 23:27:19] [INFO ] [Nat]Added 143 Read/Feed constraints in 2563 ms returned sat
[2024-05-22 23:27:19] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 146 ms.
[2024-05-22 23:27:20] [INFO ] Added : 1 causal constraints over 1 iterations in 333 ms. Result :sat
Minimization took 4505 ms.
[2024-05-22 23:27:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-22 23:27:24] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2024-05-22 23:27:25] [INFO ] [Real]Added 143 Read/Feed constraints in 280 ms returned sat
[2024-05-22 23:27:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:27:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 23:27:25] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2024-05-22 23:27:26] [INFO ] [Nat]Added 143 Read/Feed constraints in 446 ms returned sat
[2024-05-22 23:27:26] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 172 ms.
[2024-05-22 23:27:26] [INFO ] Added : 2 causal constraints over 2 iterations in 632 ms. Result :sat
Minimization took 2765 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 15] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 15] Max Struct:[+inf, +inf]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 63 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 78 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2024-05-22 23:27:29] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
[2024-05-22 23:27:29] [INFO ] Invariant cache hit.
[2024-05-22 23:27:30] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-22 23:27:30] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
[2024-05-22 23:27:30] [INFO ] Invariant cache hit.
[2024-05-22 23:27:30] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-22 23:27:33] [INFO ] Implicit Places using invariants and state equation in 3022 ms returned []
Implicit Place search using SMT with State Equation took 3351 ms to find 0 implicit places.
[2024-05-22 23:27:33] [INFO ] Redundant transitions in 152 ms returned []
Running 2974 sub problems to find dead transitions.
[2024-05-22 23:27:33] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
[2024-05-22 23:27:33] [INFO ] Invariant cache hit.
[2024-05-22 23:27:33] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2974 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/2324 variables, and 3 constraints, problems are : Problem set: 0 solved, 2974 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/235 constraints, ReadFeed: 0/143 constraints, PredecessorRefiner: 2974/2974 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2974 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2974 unsolved
[2024-05-22 23:28:29] [INFO ] Deduced a trap composed of 157 places in 186 ms of which 3 ms to minimize.
[2024-05-22 23:28:29] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 2 ms to minimize.
Problem TDEAD1984 is UNSAT
[2024-05-22 23:28:30] [INFO ] Deduced a trap composed of 167 places in 191 ms of which 2 ms to minimize.
[2024-05-22 23:28:30] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 2 ms to minimize.
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2029 is UNSAT
Problem TDEAD2030 is UNSAT
Problem TDEAD2031 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2041 is UNSAT
Problem TDEAD2042 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2052 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2091 is UNSAT
[2024-05-22 23:28:31] [INFO ] Deduced a trap composed of 159 places in 204 ms of which 1 ms to minimize.
[2024-05-22 23:28:31] [INFO ] Deduced a trap composed of 159 places in 191 ms of which 2 ms to minimize.
Problem TDEAD2094 is UNSAT
Problem TDEAD2095 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
[2024-05-22 23:28:31] [INFO ] Deduced a trap composed of 159 places in 204 ms of which 1 ms to minimize.
[2024-05-22 23:28:31] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 2 ms to minimize.
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
[2024-05-22 23:28:32] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 1 ms to minimize.
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2201 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2218 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2237 is UNSAT
Problem TDEAD2238 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2240 is UNSAT
Problem TDEAD2241 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2243 is UNSAT
Problem TDEAD2244 is UNSAT
Problem TDEAD2245 is UNSAT
Problem TDEAD2246 is UNSAT
Problem TDEAD2247 is UNSAT
Problem TDEAD2248 is UNSAT
Problem TDEAD2252 is UNSAT
Problem TDEAD2253 is UNSAT
Problem TDEAD2257 is UNSAT
Problem TDEAD2258 is UNSAT
Problem TDEAD2262 is UNSAT
Problem TDEAD2263 is UNSAT
Problem TDEAD2267 is UNSAT
Problem TDEAD2268 is UNSAT
Problem TDEAD2272 is UNSAT
Problem TDEAD2273 is UNSAT
Problem TDEAD2277 is UNSAT
Problem TDEAD2278 is UNSAT
Problem TDEAD2282 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2288 is UNSAT
Problem TDEAD2292 is UNSAT
Problem TDEAD2293 is UNSAT
Problem TDEAD2297 is UNSAT
Problem TDEAD2298 is UNSAT
Problem TDEAD2302 is UNSAT
Problem TDEAD2303 is UNSAT
Problem TDEAD2307 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2311 is UNSAT
Problem TDEAD2315 is UNSAT
Problem TDEAD2316 is UNSAT
Problem TDEAD2320 is UNSAT
Problem TDEAD2321 is UNSAT
Problem TDEAD2325 is UNSAT
Problem TDEAD2326 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2331 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2355 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2360 is UNSAT
Problem TDEAD2361 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2366 is UNSAT
Problem TDEAD2368 is UNSAT
Problem TDEAD2369 is UNSAT
Problem TDEAD2370 is UNSAT
Problem TDEAD2371 is UNSAT
Problem TDEAD2372 is UNSAT
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2689 is UNSAT
Problem TDEAD2690 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2705 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2753 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2762 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2767 is UNSAT
Problem TDEAD2768 is UNSAT
Problem TDEAD2772 is UNSAT
Problem TDEAD2773 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2778 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2792 is UNSAT
Problem TDEAD2793 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD2806 is UNSAT
Problem TDEAD2807 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2809 is UNSAT
Problem TDEAD2810 is UNSAT
Problem TDEAD2811 is UNSAT
Problem TDEAD2812 is UNSAT
Problem TDEAD2813 is UNSAT
Problem TDEAD2814 is UNSAT
Problem TDEAD2815 is UNSAT
Problem TDEAD2816 is UNSAT
Problem TDEAD2817 is UNSAT
Problem TDEAD2818 is UNSAT
Problem TDEAD2819 is UNSAT
Problem TDEAD2820 is UNSAT
Problem TDEAD2821 is UNSAT
Problem TDEAD2822 is UNSAT
Problem TDEAD2823 is UNSAT
Problem TDEAD2824 is UNSAT
Problem TDEAD2825 is UNSAT
Problem TDEAD2826 is UNSAT
Problem TDEAD2827 is UNSAT
Problem TDEAD2828 is UNSAT
Problem TDEAD2829 is UNSAT
Problem TDEAD2830 is UNSAT
Problem TDEAD2831 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2834 is UNSAT
Problem TDEAD2835 is UNSAT
Problem TDEAD2836 is UNSAT
Problem TDEAD2837 is UNSAT
Problem TDEAD2838 is UNSAT
Problem TDEAD2839 is UNSAT
Problem TDEAD2840 is UNSAT
Problem TDEAD2841 is UNSAT
Problem TDEAD2842 is UNSAT
Problem TDEAD2843 is UNSAT
Problem TDEAD2844 is UNSAT
Problem TDEAD2845 is UNSAT
Problem TDEAD2846 is UNSAT
Problem TDEAD2847 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 9/12 constraints. Problems are: Problem set: 576 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/2324 variables, and 12 constraints, problems are : Problem set: 576 solved, 2398 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/235 constraints, ReadFeed: 0/143 constraints, PredecessorRefiner: 0/2974 constraints, Known Traps: 9/9 constraints]
After SMT, in 67208ms problems are : Problem set: 576 solved, 2398 unsolved
Search for dead transitions found 576 dead transitions in 67292ms
Found 576 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 576 transitions
Dead transitions reduction (with SMT) removed 576 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/235 places, 2400/2976 transitions.
Graph (complete) has 4088 edges and 235 vertex of which 203 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.5 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 44 ms. Remains 203 /235 variables (removed 32) and now considering 2400/2400 (removed 0) transitions.
[2024-05-22 23:28:40] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
// Phase 1: matrix 1603 rows 203 cols
[2024-05-22 23:28:40] [INFO ] Computed 2 invariants in 12 ms
[2024-05-22 23:28:41] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-22 23:28:41] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:28:41] [INFO ] Invariant cache hit.
[2024-05-22 23:28:41] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:28:43] [INFO ] Implicit Places using invariants and state equation in 2301 ms returned []
Implicit Place search using SMT with State Equation took 2856 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 203/235 places, 2400/2976 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 73836 ms. Remains : 203/235 places, 2400/2976 transitions.
[2024-05-22 23:28:43] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 145 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :[1, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 15] Max Struct:[+inf, +inf]
[2024-05-22 23:28:44] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:28:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 15] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (9509 resets) in 1657 ms. (603 steps per ms)
BEST_FIRST walk for 2000002 steps (2987 resets) in 1191 ms. (1677 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 15] Max Struct:[+inf, +inf]
[2024-05-22 23:28:47] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:28:47] [INFO ] Invariant cache hit.
[2024-05-22 23:28:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:28:47] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-05-22 23:28:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:28:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:28:47] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-05-22 23:28:47] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:28:48] [INFO ] [Nat]Added 137 Read/Feed constraints in 622 ms returned sat
[2024-05-22 23:28:48] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 1 ms to minimize.
[2024-05-22 23:28:49] [INFO ] Deduced a trap composed of 77 places in 210 ms of which 1 ms to minimize.
[2024-05-22 23:28:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 489 ms
[2024-05-22 23:28:49] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 124 ms.
[2024-05-22 23:28:49] [INFO ] Added : 0 causal constraints over 0 iterations in 224 ms. Result :sat
Minimization took 3595 ms.
[2024-05-22 23:28:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 23:28:53] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2024-05-22 23:28:53] [INFO ] [Real]Added 137 Read/Feed constraints in 29 ms returned sat
[2024-05-22 23:28:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:28:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 23:28:53] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-05-22 23:28:53] [INFO ] [Nat]Added 137 Read/Feed constraints in 116 ms returned sat
[2024-05-22 23:28:53] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 117 ms.
[2024-05-22 23:28:54] [INFO ] Added : 2 causal constraints over 2 iterations in 494 ms. Result :sat
Minimization took 2803 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 15] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 15] Max Struct:[+inf, +inf]
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 36 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 36 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-22 23:28:57] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:28:57] [INFO ] Invariant cache hit.
[2024-05-22 23:28:57] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-22 23:28:57] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:28:57] [INFO ] Invariant cache hit.
[2024-05-22 23:28:57] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:28:59] [INFO ] Implicit Places using invariants and state equation in 2295 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
[2024-05-22 23:28:59] [INFO ] Redundant transitions in 116 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-05-22 23:28:59] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:28:59] [INFO ] Invariant cache hit.
[2024-05-22 23:28:59] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 31163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 66460ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 66486ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69145 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-05-22 23:30:06] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 145 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :[3, 7]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 15] Max Struct:[+inf, +inf]
[2024-05-22 23:30:07] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:30:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 15] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (9524 resets) in 1592 ms. (627 steps per ms)
BEST_FIRST walk for 2000002 steps (2981 resets) in 1168 ms. (1710 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 15] Max Struct:[+inf, +inf]
[2024-05-22 23:30:10] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:30:10] [INFO ] Invariant cache hit.
[2024-05-22 23:30:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:30:10] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-05-22 23:30:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:30:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 23:30:10] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2024-05-22 23:30:10] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:30:11] [INFO ] [Nat]Added 137 Read/Feed constraints in 632 ms returned sat
[2024-05-22 23:30:11] [INFO ] Deduced a trap composed of 77 places in 179 ms of which 1 ms to minimize.
[2024-05-22 23:30:11] [INFO ] Deduced a trap composed of 77 places in 235 ms of which 2 ms to minimize.
[2024-05-22 23:30:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 524 ms
[2024-05-22 23:30:11] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 131 ms.
[2024-05-22 23:30:12] [INFO ] Added : 0 causal constraints over 0 iterations in 228 ms. Result :sat
Minimization took 3605 ms.
[2024-05-22 23:30:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:30:15] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-05-22 23:30:16] [INFO ] [Real]Added 137 Read/Feed constraints in 29 ms returned sat
[2024-05-22 23:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:30:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:30:16] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2024-05-22 23:30:16] [INFO ] [Nat]Added 137 Read/Feed constraints in 108 ms returned sat
[2024-05-22 23:30:16] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 133 ms.
[2024-05-22 23:30:16] [INFO ] Added : 2 causal constraints over 2 iterations in 509 ms. Result :sat
Minimization took 2843 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 15] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 15] Max Struct:[+inf, +inf]
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 39 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 49 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-22 23:30:20] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:30:20] [INFO ] Invariant cache hit.
[2024-05-22 23:30:20] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 23:30:20] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:30:20] [INFO ] Invariant cache hit.
[2024-05-22 23:30:20] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:30:22] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 2500 ms to find 0 implicit places.
[2024-05-22 23:30:22] [INFO ] Redundant transitions in 52 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-05-22 23:30:22] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:30:22] [INFO ] Invariant cache hit.
[2024-05-22 23:30:22] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 31102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 66276ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 66297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68908 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-05-22 23:31:28] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 142 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :[2, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 15] Max Struct:[+inf, +inf]
RANDOM walk for 40012 steps (381 resets) in 575 ms. (69 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (65 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (53 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
[2024-05-22 23:31:30] [INFO ] Flatten gal took : 260 ms
[2024-05-22 23:31:30] [INFO ] Flatten gal took : 137 ms
[2024-05-22 23:31:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17703693604821776118.gal : 44 ms
[2024-05-22 23:31:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3208226268282307875.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17703693604821776118.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3208226268282307875.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3208226268282307875.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 63
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :63 after 931
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :931 after 39369
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :39369 after 162882
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :162882 after 287923
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :287923 after 297345
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :297345 after 640231
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :640231 after 1.20512e+06
Interrupted probabilistic random walk after 261597 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 261597 steps, saw 194130 distinct states, run finished after 3005 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-22 23:31:33] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:31:33] [INFO ] Invariant cache hit.
[2024-05-22 23:31:33] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1555/1687 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 80/1767 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1767 variables, 72/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1767 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/1806 variables, 29/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1806 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 134/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1555/1687 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 80/1767 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1767 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1767 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.20512e+06 after 1.477e+06
At refinement iteration 10 (OVERLAPS) 39/1806 variables, 29/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 134/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 23:31:34] [INFO ] Deduced a trap composed of 104 places in 240 ms of which 1 ms to minimize.
[2024-05-22 23:31:35] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1806 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 346 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1882 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2443ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 40 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 203/203 places, 2400/2400 transitions.
RANDOM walk for 40017 steps (377 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (64 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (52 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 236891 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 236891 steps, saw 176217 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-22 23:31:38] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:31:38] [INFO ] Invariant cache hit.
[2024-05-22 23:31:38] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1555/1687 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 80/1767 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1767 variables, 72/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1767 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/1806 variables, 29/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1806 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 134/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1555/1687 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 80/1767 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1767 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.477e+06 after 3.43494e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/1767 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 39/1806 variables, 29/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 134/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 23:31:40] [INFO ] Deduced a trap composed of 104 places in 223 ms of which 2 ms to minimize.
[2024-05-22 23:31:40] [INFO ] Deduced a trap composed of 117 places in 216 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1806 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 346 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1723 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2293ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 38 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 35 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-22 23:31:41] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:31:41] [INFO ] Invariant cache hit.
[2024-05-22 23:31:41] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-22 23:31:41] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:31:41] [INFO ] Invariant cache hit.
[2024-05-22 23:31:41] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:31:43] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 2526 ms to find 0 implicit places.
[2024-05-22 23:31:43] [INFO ] Redundant transitions in 52 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-05-22 23:31:43] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:31:43] [INFO ] Invariant cache hit.
[2024-05-22 23:31:43] [INFO ] State equation strengthened by 137 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.43494e+06 after 8.0212e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Detected timeout of ITS tools.
[2024-05-22 23:32:20] [INFO ] Flatten gal took : 92 ms
[2024-05-22 23:32:20] [INFO ] Applying decomposition
[2024-05-22 23:32:20] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2793154038400864797.txt' '-o' '/tmp/graph2793154038400864797.bin' '-w' '/tmp/graph2793154038400864797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2793154038400864797.bin' '-l' '-1' '-v' '-w' '/tmp/graph2793154038400864797.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:32:21] [INFO ] Decomposing Gal with order
[2024-05-22 23:32:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:32:21] [INFO ] Removed a total of 5285 redundant transitions.
[2024-05-22 23:32:21] [INFO ] Flatten gal took : 349 ms
[2024-05-22 23:32:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 534 labels/synchronizations in 95 ms.
[2024-05-22 23:32:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4121478914883881387.gal : 25 ms
[2024-05-22 23:32:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13497740232677980563.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4121478914883881387.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13497740232677980563.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13497740232677980563.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 42
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :42 after 711
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :711 after 719
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :719 after 5173
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5173 after 19104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :19104 after 26263
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :26263 after 33629
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :33629 after 257325
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :257325 after 336774
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :336774 after 366293
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 31112 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 66757ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 66781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69412 ms. Remains : 203/203 places, 2400/2400 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 797 transitions
Reduce isomorphic transitions removed 797 transitions.
Iterating post reduction 0 with 797 rules applied. Total rules applied 797 place count 203 transition count 1603
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 797 place count 203 transition count 1596
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 811 place count 196 transition count 1596
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 815 place count 194 transition count 1594
Applied a total of 815 rules in 48 ms. Remains 194 /203 variables (removed 9) and now considering 1594/2400 (removed 806) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1594 rows 194 cols
[2024-05-22 23:32:50] [INFO ] Computed 2 invariants in 11 ms
[2024-05-22 23:32:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:32:50] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:32:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:32:51] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 23:32:51] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 23:32:51] [INFO ] After 80ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 23:32:51] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 23:32:51] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 23:32:51] [INFO ] Flatten gal took : 49 ms
[2024-05-22 23:32:51] [INFO ] Flatten gal took : 48 ms
[2024-05-22 23:32:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11913491179645776957.gal : 12 ms
[2024-05-22 23:32:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7109158775512793741.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11913491179645776957.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7109158775512793741.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7109158775512793741.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 63
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :63 after 931
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :931 after 10163
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10163 after 220319
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :220319 after 266112
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :266112 after 369600
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :369600 after 493190
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :493190 after 1.59514e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.59514e+06 after 1.97363e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.97363e+06 after 1.77608e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :366293 after 1.03516e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.03516e+06 after 1.19751e+06
Detected timeout of ITS tools.
[2024-05-22 23:33:06] [INFO ] Flatten gal took : 51 ms
[2024-05-22 23:33:06] [INFO ] Applying decomposition
[2024-05-22 23:33:06] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13801221545042787788.txt' '-o' '/tmp/graph13801221545042787788.bin' '-w' '/tmp/graph13801221545042787788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13801221545042787788.bin' '-l' '-1' '-v' '-w' '/tmp/graph13801221545042787788.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:33:06] [INFO ] Decomposing Gal with order
[2024-05-22 23:33:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:33:07] [INFO ] Removed a total of 3894 redundant transitions.
[2024-05-22 23:33:07] [INFO ] Flatten gal took : 98 ms
[2024-05-22 23:33:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 60 ms.
[2024-05-22 23:33:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2365483099825477179.gal : 20 ms
[2024-05-22 23:33:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17373809151708782800.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2365483099825477179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17373809151708782800.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17373809151708782800.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 189
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :189 after 5166
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :5166 after 9009
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9009 after 26389
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :26389 after 53316
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :53316 after 61733
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :61733 after 78814
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :78814 after 178007
Detected timeout of ITS tools.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :178007 after 3.28201e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31867 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[6, 15] Max Struct:[+inf, +inf]
Starting property specific reduction for DoubleLock-PT-p3s3-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 23:33:22] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
// Phase 1: matrix 1603 rows 203 cols
[2024-05-22 23:33:22] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (93 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (16 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-22 23:33:22] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:33:22] [INFO ] Invariant cache hit.
[2024-05-22 23:33:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 23:33:22] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-05-22 23:33:22] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:33:22] [INFO ] [Real]Added 137 Read/Feed constraints in 93 ms returned sat
[2024-05-22 23:33:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:33:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:33:23] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2024-05-22 23:33:23] [INFO ] [Nat]Added 137 Read/Feed constraints in 315 ms returned sat
[2024-05-22 23:33:23] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 133 ms.
[2024-05-22 23:33:23] [INFO ] Added : 0 causal constraints over 0 iterations in 221 ms. Result :sat
Minimization took 672 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 47 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-05-22 23:33:24] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 142 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-22 23:33:25] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:33:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (9497 resets) in 1756 ms. (569 steps per ms)
BEST_FIRST walk for 1000001 steps (1654 resets) in 663 ms. (1506 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 23:33:27] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:33:27] [INFO ] Invariant cache hit.
[2024-05-22 23:33:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:33:27] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-05-22 23:33:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:33:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:33:28] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-05-22 23:33:28] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:33:28] [INFO ] [Nat]Added 137 Read/Feed constraints in 520 ms returned sat
[2024-05-22 23:33:28] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 131 ms.
[2024-05-22 23:33:29] [INFO ] Added : 0 causal constraints over 0 iterations in 223 ms. Result :sat
Minimization took 3734 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 35 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 35 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-22 23:33:32] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:33:32] [INFO ] Invariant cache hit.
[2024-05-22 23:33:33] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-22 23:33:33] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:33:33] [INFO ] Invariant cache hit.
[2024-05-22 23:33:33] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:33:35] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2024-05-22 23:33:35] [INFO ] Redundant transitions in 52 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-05-22 23:33:35] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:33:35] [INFO ] Invariant cache hit.
[2024-05-22 23:33:35] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 31076 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 66522ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 66546ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69167 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-05-22 23:34:42] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 144 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 23:34:42] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:34:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (9573 resets) in 1633 ms. (611 steps per ms)
BEST_FIRST walk for 1000001 steps (1654 resets) in 574 ms. (1739 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 23:34:45] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:34:45] [INFO ] Invariant cache hit.
[2024-05-22 23:34:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:34:45] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2024-05-22 23:34:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:34:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:34:45] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2024-05-22 23:34:45] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:34:46] [INFO ] [Nat]Added 137 Read/Feed constraints in 528 ms returned sat
[2024-05-22 23:34:46] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 116 ms.
[2024-05-22 23:34:46] [INFO ] Added : 0 causal constraints over 0 iterations in 213 ms. Result :sat
Minimization took 3575 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 42 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 41 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-22 23:34:50] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:34:50] [INFO ] Invariant cache hit.
[2024-05-22 23:34:50] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-22 23:34:50] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:34:50] [INFO ] Invariant cache hit.
[2024-05-22 23:34:50] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:34:52] [INFO ] Implicit Places using invariants and state equation in 2325 ms returned []
Implicit Place search using SMT with State Equation took 2660 ms to find 0 implicit places.
[2024-05-22 23:34:52] [INFO ] Redundant transitions in 47 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-05-22 23:34:52] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:34:52] [INFO ] Invariant cache hit.
[2024-05-22 23:34:52] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 31129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 66907ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 66927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69692 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-05-22 23:35:59] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 143 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 40010 steps (377 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (60 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-05-22 23:36:00] [INFO ] Flatten gal took : 68 ms
[2024-05-22 23:36:00] [INFO ] Flatten gal took : 60 ms
[2024-05-22 23:36:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17560589915484396522.gal : 10 ms
[2024-05-22 23:36:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7836326194107257954.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17560589915484396522.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7836326194107257954.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7836326194107257954.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 63
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :63 after 931
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :931 after 39369
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :39369 after 162882
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :162882 after 287923
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :287923 after 297345
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :297345 after 640231
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :640231 after 1.20512e+06
Interrupted probabilistic random walk after 438484 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 438484 steps, saw 322371 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-22 23:36:03] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:36:03] [INFO ] Invariant cache hit.
[2024-05-22 23:36:03] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1681 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1681 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1681 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 81/1762 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1762 variables, 71/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1762 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/1806 variables, 33/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1806 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 135/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.20512e+06 after 1.477e+06
At refinement iteration 3 (OVERLAPS) 1615/1681 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1681 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1681 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1681 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/1762 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1762 variables, 71/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1762 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/1806 variables, 33/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 135/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 23:36:05] [INFO ] Deduced a trap composed of 75 places in 226 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1005 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1822ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 35 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 203/203 places, 2400/2400 transitions.
RANDOM walk for 40005 steps (375 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (65 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 425442 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 425442 steps, saw 312915 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2024-05-22 23:36:08] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:36:08] [INFO ] Invariant cache hit.
[2024-05-22 23:36:08] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1681 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1681 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1681 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 81/1762 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1762 variables, 71/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1762 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/1806 variables, 33/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1806 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 135/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1681 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1681 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1681 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1681 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/1762 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1762 variables, 71/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1762 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/1806 variables, 33/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 135/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 23:36:10] [INFO ] Deduced a trap composed of 75 places in 244 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 38 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 37 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-22 23:36:10] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:36:10] [INFO ] Invariant cache hit.
[2024-05-22 23:36:10] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 23:36:10] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:36:10] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.477e+06 after 3.43494e+06
[2024-05-22 23:36:10] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:36:12] [INFO ] Implicit Places using invariants and state equation in 2350 ms returned []
Implicit Place search using SMT with State Equation took 2555 ms to find 0 implicit places.
[2024-05-22 23:36:13] [INFO ] Redundant transitions in 51 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-05-22 23:36:13] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:36:13] [INFO ] Invariant cache hit.
[2024-05-22 23:36:13] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.43494e+06 after 8.0212e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Detected timeout of ITS tools.
[2024-05-22 23:36:50] [INFO ] Flatten gal took : 59 ms
[2024-05-22 23:36:50] [INFO ] Applying decomposition
[2024-05-22 23:36:51] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8881494109535172773.txt' '-o' '/tmp/graph8881494109535172773.bin' '-w' '/tmp/graph8881494109535172773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8881494109535172773.bin' '-l' '-1' '-v' '-w' '/tmp/graph8881494109535172773.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:36:51] [INFO ] Decomposing Gal with order
[2024-05-22 23:36:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:36:51] [INFO ] Removed a total of 5264 redundant transitions.
[2024-05-22 23:36:51] [INFO ] Flatten gal took : 132 ms
[2024-05-22 23:36:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 498 labels/synchronizations in 70 ms.
[2024-05-22 23:36:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17864138745654007188.gal : 9 ms
[2024-05-22 23:36:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12166030194850764313.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17864138745654007188.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12166030194850764313.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12166030194850764313.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1 after 1
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1 after 7
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 31077 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 66745ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 66770ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69429 ms. Remains : 203/203 places, 2400/2400 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 797 transitions
Reduce isomorphic transitions removed 797 transitions.
Iterating post reduction 0 with 797 rules applied. Total rules applied 797 place count 203 transition count 1603
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 797 place count 203 transition count 1595
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 813 place count 195 transition count 1595
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 817 place count 193 transition count 1593
Applied a total of 817 rules in 75 ms. Remains 193 /203 variables (removed 10) and now considering 1593/2400 (removed 807) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1593 rows 193 cols
[2024-05-22 23:37:19] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 23:37:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:37:20] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:37:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-22 23:37:21] [INFO ] After 762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:37:21] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 23:37:21] [INFO ] After 58ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 23:37:21] [INFO ] Deduced a trap composed of 92 places in 198 ms of which 2 ms to minimize.
[2024-05-22 23:37:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
TRAPS : Iteration 1
[2024-05-22 23:37:21] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:37:21] [INFO ] After 1305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:37:21] [INFO ] Flatten gal took : 80 ms
[2024-05-22 23:37:21] [INFO ] Flatten gal took : 89 ms
[2024-05-22 23:37:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8963201815491368140.gal : 22 ms
[2024-05-22 23:37:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7092204719825528067.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8963201815491368140.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7092204719825528067.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7092204719825528067.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 63
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :63 after 931
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :931 after 10163
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10163 after 220319
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :220319 after 266827
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :266827 after 369655
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :369655 after 511607
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :511607 after 1.59514e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.59514e+06 after 1.97363e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.97363e+06 after 1.28975e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.28975e+07 after 3.91748e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.91748e+07 after 1.00209e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.00209e+08 after 2.18559e+08
Detected timeout of ITS tools.
[2024-05-22 23:37:37] [INFO ] Flatten gal took : 89 ms
[2024-05-22 23:37:37] [INFO ] Applying decomposition
[2024-05-22 23:37:37] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph586798127656836196.txt' '-o' '/tmp/graph586798127656836196.bin' '-w' '/tmp/graph586798127656836196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph586798127656836196.bin' '-l' '-1' '-v' '-w' '/tmp/graph586798127656836196.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:37:37] [INFO ] Decomposing Gal with order
[2024-05-22 23:37:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:37:37] [INFO ] Removed a total of 3928 redundant transitions.
[2024-05-22 23:37:37] [INFO ] Flatten gal took : 69 ms
[2024-05-22 23:37:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 25 ms.
[2024-05-22 23:37:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12748869355465650347.gal : 8 ms
[2024-05-22 23:37:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14499959433293922670.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12748869355465650347.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14499959433293922670.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14499959433293922670.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 510
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :510 after 65021
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32730 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p3s3-UpperBounds-02 in 270222 ms.
Starting property specific reduction for DoubleLock-PT-p3s3-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 23:37:52] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
// Phase 1: matrix 1603 rows 203 cols
[2024-05-22 23:37:52] [INFO ] Computed 2 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (95 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (14 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[+inf]
[2024-05-22 23:37:52] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:37:52] [INFO ] Invariant cache hit.
[2024-05-22 23:37:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:37:52] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2024-05-22 23:37:52] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:37:53] [INFO ] [Real]Added 137 Read/Feed constraints in 44 ms returned sat
[2024-05-22 23:37:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:37:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:37:53] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-05-22 23:37:53] [INFO ] [Nat]Added 137 Read/Feed constraints in 94 ms returned sat
[2024-05-22 23:37:53] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 124 ms.
[2024-05-22 23:37:53] [INFO ] Added : 2 causal constraints over 2 iterations in 319 ms. Result :sat
Minimization took 547 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 45 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-05-22 23:37:54] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 158 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[11] Max Struct:[+inf]
[2024-05-22 23:37:55] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:37:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[+inf]
RANDOM walk for 1000000 steps (9569 resets) in 1677 ms. (595 steps per ms)
BEST_FIRST walk for 1000000 steps (1337 resets) in 614 ms. (1626 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[+inf]
[2024-05-22 23:37:57] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:37:57] [INFO ] Invariant cache hit.
[2024-05-22 23:37:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:37:57] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-05-22 23:37:57] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:37:57] [INFO ] [Real]Added 137 Read/Feed constraints in 28 ms returned sat
[2024-05-22 23:37:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:37:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 23:37:58] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-05-22 23:37:58] [INFO ] [Nat]Added 137 Read/Feed constraints in 117 ms returned sat
[2024-05-22 23:37:58] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 114 ms.
[2024-05-22 23:37:58] [INFO ] Added : 2 causal constraints over 2 iterations in 490 ms. Result :sat
Minimization took 2837 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 34 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 36 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-22 23:38:01] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:38:01] [INFO ] Invariant cache hit.
[2024-05-22 23:38:02] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-22 23:38:02] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:38:02] [INFO ] Invariant cache hit.
[2024-05-22 23:38:02] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-22 23:38:04] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned []
Implicit Place search using SMT with State Equation took 2590 ms to find 0 implicit places.
[2024-05-22 23:38:04] [INFO ] Redundant transitions in 47 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-05-22 23:38:04] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:38:04] [INFO ] Invariant cache hit.
[2024-05-22 23:38:04] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 31128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 66725ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 66747ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69429 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-05-22 23:39:11] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 134 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-22 23:39:12] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-05-22 23:39:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (9516 resets) in 1603 ms. (623 steps per ms)
FORMULA DoubleLock-PT-p3s3-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-22 23:39:13] [INFO ] Flatten gal took : 61 ms
[2024-05-22 23:39:13] [INFO ] Flatten gal took : 55 ms
[2024-05-22 23:39:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15708140596071516137.gal : 9 ms
[2024-05-22 23:39:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16866252091347929654.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15708140596071516137.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16866252091347929654.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DoubleLock-PT-p3s3-UpperBounds-10 in 81283 ms.
[2024-05-22 23:39:13] [INFO ] Flatten gal took : 52 ms
[2024-05-22 23:39:13] [INFO ] Applying decomposition
[2024-05-22 23:39:13] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5548478096984774355.txt' '-o' '/tmp/graph5548478096984774355.bin' '-w' '/tmp/graph5548478096984774355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5548478096984774355.bin' '-l' '-1' '-v' '-w' '/tmp/graph5548478096984774355.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:39:14] [INFO ] Decomposing Gal with order
[2024-05-22 23:39:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:39:14] [INFO ] Removed a total of 5408 redundant transitions.
[2024-05-22 23:39:14] [INFO ] Flatten gal took : 160 ms
[2024-05-22 23:39:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 502 labels/synchronizations in 51 ms.
[2024-05-22 23:39:14] [INFO ] Time to serialize gal into /tmp/UpperBounds5370875245960190720.gal : 10 ms
[2024-05-22 23:39:14] [INFO ] Time to serialize properties into /tmp/UpperBounds7824125356629697039.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5370875245960190720.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7824125356629697039.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7824125356629697039.prop.
ITS-tools command line returned an error code 137
[2024-05-22 23:44:23] [INFO ] Flatten gal took : 57 ms
[2024-05-22 23:44:23] [INFO ] Time to serialize gal into /tmp/UpperBounds4303498498835945489.gal : 18 ms
[2024-05-22 23:44:23] [INFO ] Time to serialize properties into /tmp/UpperBounds12735757532787954741.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4303498498835945489.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12735757532787954741.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds12735757532787954741.prop.
ITS-tools command line returned an error code 137
[2024-05-22 23:49:51] [INFO ] Flatten gal took : 73 ms
[2024-05-22 23:49:51] [INFO ] Input system was already deterministic with 2400 transitions.
[2024-05-22 23:49:51] [INFO ] Transformed 203 places.
[2024-05-22 23:49:51] [INFO ] Transformed 2400 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 23:49:51] [INFO ] Time to serialize gal into /tmp/UpperBounds3185040893809534074.gal : 26 ms
[2024-05-22 23:49:51] [INFO ] Time to serialize properties into /tmp/UpperBounds15875106902761758917.prop : 64 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3185040893809534074.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15875106902761758917.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15875106902761758917.prop.
ITS-tools command line returned an error code 137
Total runtime 1718466 ms.

BK_STOP 1716422141952

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="DoubleLock-PT-p3s3"
export BK_EXAMINATION="UpperBounds"
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-5568"
echo " Executing tool itstools"
echo " Input is DoubleLock-PT-p3s3, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631133100645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s3.tgz
mv DoubleLock-PT-p3s3 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;