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.r576-smll-171734920200177.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 MedleyA-PT-23, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920200177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 150K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717400214470

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-03 07:36:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 07:36:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 07:36:56] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2024-06-03 07:36:56] [INFO ] Transformed 378 places.
[2024-06-03 07:36:56] [INFO ] Transformed 614 transitions.
[2024-06-03 07:36:56] [INFO ] Found NUPN structural information;
[2024-06-03 07:36:56] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-23-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 127 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 64 place count 314 transition count 553
Iterating global reduction 1 with 61 rules applied. Total rules applied 125 place count 314 transition count 553
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 163 place count 276 transition count 515
Iterating global reduction 1 with 38 rules applied. Total rules applied 201 place count 276 transition count 515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 205 place count 272 transition count 509
Iterating global reduction 1 with 4 rules applied. Total rules applied 209 place count 272 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 210 place count 271 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 211 place count 271 transition count 506
Applied a total of 211 rules in 136 ms. Remains 271 /378 variables (removed 107) and now considering 506/614 (removed 108) transitions.
// Phase 1: matrix 506 rows 271 cols
[2024-06-03 07:36:57] [INFO ] Computed 8 invariants in 38 ms
[2024-06-03 07:36:57] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-06-03 07:36:57] [INFO ] Invariant cache hit.
[2024-06-03 07:36:58] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Running 505 sub problems to find dead transitions.
[2024-06-03 07:36:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 506/777 variables, 271/279 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-03 07:37:16] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/777 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/777 variables, and 280 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 506/777 variables, 271/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 505/785 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-03 07:37:41] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 6 ms to minimize.
[2024-06-03 07:37:47] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 2/787 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/777 variables, and 787 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 3/3 constraints]
After SMT, in 61037ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 61084ms
Starting structural reductions in LTL mode, iteration 1 : 271/378 places, 506/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62367 ms. Remains : 271/378 places, 506/614 transitions.
Support contains 127 out of 271 places after structural reductions.
[2024-06-03 07:37:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-03 07:37:59] [INFO ] Flatten gal took : 100 ms
FORMULA MedleyA-PT-23-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 07:37:59] [INFO ] Flatten gal took : 46 ms
[2024-06-03 07:37:59] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 120 out of 271 places (down from 127) after GAL structural reductions.
RANDOM walk for 40000 steps (19 resets) in 3535 ms. (11 steps per ms) remains 31/78 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (15 resets) in 32 ms. (121 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4002 steps (10 resets) in 39 ms. (100 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4004 steps (15 resets) in 38 ms. (102 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (13 resets) in 32 ms. (121 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (14 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (12 resets) in 19 ms. (200 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (10 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (13 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
[2024-06-03 07:38:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 63/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 348/447 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 263/710 variables, 127/234 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/710 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 59/769 variables, 38/272 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 8/777 variables, 7/279 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 0/777 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 279 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1888 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 63/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 348/447 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 263/710 variables, 127/236 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/710 variables, 17/253 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/710 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 59/769 variables, 38/291 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 8/777 variables, 7/298 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/777 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/777 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 777/777 variables, and 298 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3522 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 5429ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 1 properties in 2839 ms.
Support contains 34 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 506/506 transitions.
Graph (trivial) has 189 edges and 271 vertex of which 33 / 271 are part of one of the 3 SCC in 3 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 241 transition count 439
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 218 transition count 436
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 216 transition count 436
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 52 place count 216 transition count 432
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 60 place count 212 transition count 432
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 90 place count 182 transition count 400
Iterating global reduction 3 with 30 rules applied. Total rules applied 120 place count 182 transition count 400
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 120 place count 182 transition count 396
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 178 transition count 396
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 139 place count 167 transition count 363
Iterating global reduction 3 with 11 rules applied. Total rules applied 150 place count 167 transition count 363
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 157 place count 167 transition count 356
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 195 place count 148 transition count 337
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 198 place count 148 transition count 334
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 206 place count 140 transition count 310
Iterating global reduction 5 with 8 rules applied. Total rules applied 214 place count 140 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 215 place count 140 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 217 place count 139 transition count 308
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 235 place count 130 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 242 place count 130 transition count 314
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 243 place count 129 transition count 311
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 129 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 245 place count 129 transition count 310
Free-agglomeration rule applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 276 place count 129 transition count 279
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 318 place count 98 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 324 place count 95 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 328 place count 95 transition count 261
Applied a total of 328 rules in 170 ms. Remains 95 /271 variables (removed 176) and now considering 261/506 (removed 245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 95/271 places, 261/506 transitions.
RANDOM walk for 40000 steps (8 resets) in 537 ms. (74 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40002 steps (9 resets) in 55 ms. (714 steps per ms) remains 1/2 properties
BEST_FIRST walk for 28585 steps (8 resets) in 49 ms. (571 steps per ms) remains 0/1 properties
[2024-06-03 07:38:10] [INFO ] Flatten gal took : 54 ms
[2024-06-03 07:38:10] [INFO ] Flatten gal took : 62 ms
[2024-06-03 07:38:10] [INFO ] Input system was already deterministic with 506 transitions.
Computed a total of 24 stabilizing places and 29 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 226 transition count 461
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 226 transition count 461
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 120 place count 196 transition count 417
Iterating global reduction 0 with 30 rules applied. Total rules applied 150 place count 196 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 151 place count 196 transition count 416
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 169 place count 178 transition count 374
Iterating global reduction 1 with 18 rules applied. Total rules applied 187 place count 178 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 189 place count 178 transition count 372
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 195 place count 172 transition count 356
Iterating global reduction 2 with 6 rules applied. Total rules applied 201 place count 172 transition count 356
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 204 place count 172 transition count 353
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 207 place count 169 transition count 346
Iterating global reduction 3 with 3 rules applied. Total rules applied 210 place count 169 transition count 346
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 213 place count 169 transition count 343
Applied a total of 213 rules in 33 ms. Remains 169 /271 variables (removed 102) and now considering 343/506 (removed 163) transitions.
// Phase 1: matrix 343 rows 169 cols
[2024-06-03 07:38:10] [INFO ] Computed 8 invariants in 5 ms
[2024-06-03 07:38:10] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-03 07:38:10] [INFO ] Invariant cache hit.
[2024-06-03 07:38:10] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2024-06-03 07:38:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-06-03 07:38:16] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (OVERLAPS) 343/512 variables, 169/178 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-06-03 07:38:22] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 179 constraints, problems are : Problem set: 0 solved, 342 unsolved in 23397 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (OVERLAPS) 343/512 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 342/521 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-06-03 07:38:40] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2024-06-03 07:38:40] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-06-03 07:38:50] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 2 ms to minimize.
[2024-06-03 07:38:50] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 525 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 6/6 constraints]
After SMT, in 53700ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 53707ms
Starting structural reductions in LTL mode, iteration 1 : 169/271 places, 343/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54346 ms. Remains : 169/271 places, 343/506 transitions.
[2024-06-03 07:39:04] [INFO ] Flatten gal took : 31 ms
[2024-06-03 07:39:04] [INFO ] Flatten gal took : 32 ms
[2024-06-03 07:39:04] [INFO ] Input system was already deterministic with 343 transitions.
[2024-06-03 07:39:04] [INFO ] Flatten gal took : 30 ms
[2024-06-03 07:39:04] [INFO ] Flatten gal took : 26 ms
[2024-06-03 07:39:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality17600229757182974333.gal : 27 ms
[2024-06-03 07:39:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality9976666520312793410.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17600229757182974333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9976666520312793410.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 07:39:35] [INFO ] Flatten gal took : 15 ms
[2024-06-03 07:39:35] [INFO ] Applying decomposition
[2024-06-03 07:39:35] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9160451214880990266.txt' '-o' '/tmp/graph9160451214880990266.bin' '-w' '/tmp/graph9160451214880990266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9160451214880990266.bin' '-l' '-1' '-v' '-w' '/tmp/graph9160451214880990266.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:39:35] [INFO ] Decomposing Gal with order
[2024-06-03 07:39:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:39:35] [INFO ] Removed a total of 493 redundant transitions.
[2024-06-03 07:39:35] [INFO ] Flatten gal took : 91 ms
[2024-06-03 07:39:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 11 ms.
[2024-06-03 07:39:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality14363297765574355073.gal : 9 ms
[2024-06-03 07:39:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14957693222700065087.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14363297765574355073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14957693222700065087.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05107e+10,3.08725,64476,1481,65,107791,953,759,210800,90,3666,0


Converting to forward existential form...Done !
original formula: (A((((EF((i1.u10.p70==1)) + AF(((i1.u9.p67==0)||(i10.i0.u52.p368==1)))) * (((i2.i0.u13.p78==0)||(i0.u5.p30==1)) + (((i2.i0.u11.p72==1)&&(...492
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(!((E(TRUE U (((i4.u32.p195==0)||(i0.u5.p29==1))&&((i6.i1.u20.p133==0)||(i7.u40.p318==1))))...855
Reverse transition relation is NOT exact ! Due to transitions t23, t55, t96, t126, t136, t155, t157, t158, t166, t186, t193, t195, t196, t211, t218, t220, ...1042
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 220 transition count 455
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 220 transition count 455
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 134 place count 188 transition count 409
Iterating global reduction 0 with 32 rules applied. Total rules applied 166 place count 188 transition count 409
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 184 place count 170 transition count 367
Iterating global reduction 0 with 18 rules applied. Total rules applied 202 place count 170 transition count 367
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 210 place count 162 transition count 347
Iterating global reduction 0 with 8 rules applied. Total rules applied 218 place count 162 transition count 347
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 222 place count 162 transition count 343
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 226 place count 158 transition count 333
Iterating global reduction 1 with 4 rules applied. Total rules applied 230 place count 158 transition count 333
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 234 place count 158 transition count 329
Applied a total of 234 rules in 19 ms. Remains 158 /271 variables (removed 113) and now considering 329/506 (removed 177) transitions.
// Phase 1: matrix 329 rows 158 cols
[2024-06-03 07:40:05] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:40:05] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-03 07:40:05] [INFO ] Invariant cache hit.
[2024-06-03 07:40:05] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-03 07:40:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 329/487 variables, 158/166 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-03 07:40:15] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (OVERLAPS) 0/487 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 167 constraints, problems are : Problem set: 0 solved, 328 unsolved in 22712 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 329/487 variables, 158/167 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 328/495 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 0/487 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 495 constraints, problems are : Problem set: 0 solved, 328 unsolved in 24366 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 1/1 constraints]
After SMT, in 47330ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 47336ms
Starting structural reductions in LTL mode, iteration 1 : 158/271 places, 329/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47859 ms. Remains : 158/271 places, 329/506 transitions.
[2024-06-03 07:40:53] [INFO ] Flatten gal took : 24 ms
[2024-06-03 07:40:53] [INFO ] Flatten gal took : 26 ms
[2024-06-03 07:40:53] [INFO ] Input system was already deterministic with 329 transitions.
[2024-06-03 07:40:53] [INFO ] Flatten gal took : 22 ms
[2024-06-03 07:40:53] [INFO ] Flatten gal took : 23 ms
[2024-06-03 07:40:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality7437321285249275332.gal : 5 ms
[2024-06-03 07:40:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality703458649184836244.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7437321285249275332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality703458649184836244.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 07:41:23] [INFO ] Flatten gal took : 19 ms
[2024-06-03 07:41:23] [INFO ] Applying decomposition
[2024-06-03 07:41:23] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7555488086941724771.txt' '-o' '/tmp/graph7555488086941724771.bin' '-w' '/tmp/graph7555488086941724771.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7555488086941724771.bin' '-l' '-1' '-v' '-w' '/tmp/graph7555488086941724771.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:41:23] [INFO ] Decomposing Gal with order
[2024-06-03 07:41:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:41:23] [INFO ] Removed a total of 479 redundant transitions.
[2024-06-03 07:41:23] [INFO ] Flatten gal took : 52 ms
[2024-06-03 07:41:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 9 ms.
[2024-06-03 07:41:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8639625804940548307.gal : 6 ms
[2024-06-03 07:41:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality625797598881705656.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8639625804940548307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality625797598881705656.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10823e+10,2.1921,51104,1354,44,81604,528,630,194123,81,1479,0


Converting to forward existential form...Done !
original formula: AX(AG(AF(((EF((i3.u17.p94==0)) + AG((i3.u11.p57==0))) + (((i3.u11.p46==0)||(i1.u3.p21==1))&&((i3.u12.p48==0)||(i3.u19.p124==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),!(((E(TRUE U (i3.u17.p94==0)) + !(E(TRUE U !((i3.u11.p57==0))))) + (((i3.u11.p46==0)||...220
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t136, t147, t149, t150, t183, t185, t186, t207, t209, t210, t215, t216, t217, t218,...879
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Graph (trivial) has 226 edges and 271 vertex of which 30 / 271 are part of one of the 3 SCC in 2 ms
Free SCC test removed 27 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 243 transition count 428
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 202 transition count 426
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 85 place count 202 transition count 423
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 199 transition count 423
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 140 place count 150 transition count 370
Iterating global reduction 2 with 49 rules applied. Total rules applied 189 place count 150 transition count 370
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 189 place count 150 transition count 362
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 205 place count 142 transition count 362
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 227 place count 120 transition count 296
Iterating global reduction 2 with 22 rules applied. Total rules applied 249 place count 120 transition count 296
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 259 place count 120 transition count 286
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 118 transition count 282
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 118 transition count 282
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 265 place count 116 transition count 276
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 116 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 269 place count 116 transition count 274
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 295 place count 103 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 296 place count 103 transition count 260
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 305 place count 94 transition count 233
Iterating global reduction 5 with 9 rules applied. Total rules applied 314 place count 94 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 315 place count 94 transition count 232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 316 place count 93 transition count 230
Iterating global reduction 6 with 1 rules applied. Total rules applied 317 place count 93 transition count 230
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 318 place count 92 transition count 227
Iterating global reduction 6 with 1 rules applied. Total rules applied 319 place count 92 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 320 place count 92 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 322 place count 91 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 327 place count 91 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 333 place count 88 transition count 217
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 335 place count 86 transition count 211
Iterating global reduction 7 with 2 rules applied. Total rules applied 337 place count 86 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 339 place count 86 transition count 209
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 341 place count 84 transition count 207
Applied a total of 341 rules in 103 ms. Remains 84 /271 variables (removed 187) and now considering 207/506 (removed 299) transitions.
[2024-06-03 07:41:53] [INFO ] Flow matrix only has 197 transitions (discarded 10 similar events)
// Phase 1: matrix 197 rows 84 cols
[2024-06-03 07:41:53] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:41:54] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-03 07:41:54] [INFO ] Flow matrix only has 197 transitions (discarded 10 similar events)
[2024-06-03 07:41:54] [INFO ] Invariant cache hit.
[2024-06-03 07:41:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 07:41:54] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-03 07:41:54] [INFO ] Redundant transitions in 11 ms returned []
Running 179 sub problems to find dead transitions.
[2024-06-03 07:41:54] [INFO ] Flow matrix only has 197 transitions (discarded 10 similar events)
[2024-06-03 07:41:54] [INFO ] Invariant cache hit.
[2024-06-03 07:41:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 196/277 variables, 81/89 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 3/280 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/281 variables, and 93 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8188 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 196/277 variables, 81/89 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 27/117 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 3/280 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 152/272 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/281 variables, and 272 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7740 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 16023ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 16026ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/271 places, 207/506 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16439 ms. Remains : 84/271 places, 207/506 transitions.
[2024-06-03 07:42:10] [INFO ] Flatten gal took : 12 ms
[2024-06-03 07:42:10] [INFO ] Flatten gal took : 12 ms
[2024-06-03 07:42:10] [INFO ] Input system was already deterministic with 207 transitions.
[2024-06-03 07:42:10] [INFO ] Flatten gal took : 11 ms
[2024-06-03 07:42:10] [INFO ] Flatten gal took : 12 ms
[2024-06-03 07:42:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality12006561961189719551.gal : 3 ms
[2024-06-03 07:42:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality4684326118970399859.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12006561961189719551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4684326118970399859.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63168e+07,7.56287,159148,2,9420,5,407057,6,0,538,613316,0


Converting to forward existential form...Done !
original formula: EF(AG(((((p320==0)||(p267==1))||((p280==1)||(p260==1)))||(p350==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((p320==0)||(p267==1))||((p280==1)||(p260==1)))||(p350==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t15, t16, t17, t21, t24, t27, t28, t35, t36, t39, t42, t43, t50, t51, t77, t78, t...484
Detected timeout of ITS tools.
[2024-06-03 07:42:40] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:42:40] [INFO ] Applying decomposition
[2024-06-03 07:42:40] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7027163053459631995.txt' '-o' '/tmp/graph7027163053459631995.bin' '-w' '/tmp/graph7027163053459631995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7027163053459631995.bin' '-l' '-1' '-v' '-w' '/tmp/graph7027163053459631995.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:42:40] [INFO ] Decomposing Gal with order
[2024-06-03 07:42:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:42:40] [INFO ] Removed a total of 329 redundant transitions.
[2024-06-03 07:42:40] [INFO ] Flatten gal took : 22 ms
[2024-06-03 07:42:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 11 ms.
[2024-06-03 07:42:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality3183716769845843481.gal : 3 ms
[2024-06-03 07:42:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality15417061643573115578.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3183716769845843481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15417061643573115578.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63168e+07,0.285792,9112,306,101,9392,896,447,17643,97,2945,0


Converting to forward existential form...Done !
original formula: EF(AG(((((i5.i1.u17.p320==0)||(i5.i0.u13.p267==1))||((i5.i1.u17.p280==1)||(i5.i0.u12.p260==1)))||(i7.u20.p350==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((i5.i1.u17.p320==0)||(i5.i0.u13.p267==1))||((i5.i1.u17.p280==1)||(i5.i0.u12....198
Reverse transition relation is NOT exact ! Due to transitions t77, t78, t79, t89, t90, t91, t107, t108, t109, t110, t111, t112, t136, t138, t140, t141, t17...517
(forward)formula 0,1,1.73356,45016,1,0,63324,4476,2214,228369,470,21377,115619
FORMULA MedleyA-PT-23-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 219 transition count 454
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 219 transition count 454
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 136 place count 187 transition count 406
Iterating global reduction 0 with 32 rules applied. Total rules applied 168 place count 187 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 169 place count 187 transition count 405
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 188 place count 168 transition count 361
Iterating global reduction 1 with 19 rules applied. Total rules applied 207 place count 168 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 209 place count 168 transition count 359
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 217 place count 160 transition count 338
Iterating global reduction 2 with 8 rules applied. Total rules applied 225 place count 160 transition count 338
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 230 place count 160 transition count 333
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 233 place count 157 transition count 326
Iterating global reduction 3 with 3 rules applied. Total rules applied 236 place count 157 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 239 place count 157 transition count 323
Applied a total of 239 rules in 25 ms. Remains 157 /271 variables (removed 114) and now considering 323/506 (removed 183) transitions.
// Phase 1: matrix 323 rows 157 cols
[2024-06-03 07:42:42] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:42:42] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-03 07:42:42] [INFO ] Invariant cache hit.
[2024-06-03 07:42:42] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-06-03 07:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 323/480 variables, 157/165 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-03 07:42:52] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 166 constraints, problems are : Problem set: 0 solved, 322 unsolved in 23135 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/480 variables, 157/166 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 322/488 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-03 07:43:12] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2024-06-03 07:43:14] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
[2024-06-03 07:43:15] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-03 07:43:27] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/480 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 492 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 5/5 constraints]
After SMT, in 53392ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 53395ms
Starting structural reductions in LTL mode, iteration 1 : 157/271 places, 323/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53864 ms. Remains : 157/271 places, 323/506 transitions.
[2024-06-03 07:43:36] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:43:36] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:43:36] [INFO ] Input system was already deterministic with 323 transitions.
[2024-06-03 07:43:36] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:43:36] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:43:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality12765512474521377147.gal : 2 ms
[2024-06-03 07:43:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality1125793769368311186.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12765512474521377147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1125793769368311186.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.91507e+09,2.93425,64552,1291,55,109108,666,628,214760,82,2042,0


Converting to forward existential form...Done !
original formula: EF((EX(!(E((((i2.u9.p71==0)||(i4.u33.p300==0))||(i6.u0.p1==1)) U ((i9.u46.p368==0)&&((i2.u14.p114==0)||(i4.u32.p298==1)))))) * (i2.u8.p68...161
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (i2.u8.p68==0))) * !(E((((i2.u9.p71==0)||(i4.u33.p300==0))||(i6.u0.p1==1)) U ((i9.u46.p3...213
Reverse transition relation is NOT exact ! Due to transitions t20, t57, t123, t141, t143, t144, t177, t179, t180, t201, t203, t204, t219, t220, t221, t222,...906
(forward)formula 0,1,4.30267,64816,1,0,109108,860,3630,214760,389,2330,321636
FORMULA MedleyA-PT-23-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 216 transition count 451
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 216 transition count 451
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 145 place count 181 transition count 398
Iterating global reduction 0 with 35 rules applied. Total rules applied 180 place count 181 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 181 place count 181 transition count 397
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 202 place count 160 transition count 349
Iterating global reduction 1 with 21 rules applied. Total rules applied 223 place count 160 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 225 place count 160 transition count 347
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 234 place count 151 transition count 324
Iterating global reduction 2 with 9 rules applied. Total rules applied 243 place count 151 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 248 place count 151 transition count 319
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 252 place count 147 transition count 309
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 147 transition count 309
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 260 place count 147 transition count 305
Applied a total of 260 rules in 30 ms. Remains 147 /271 variables (removed 124) and now considering 305/506 (removed 201) transitions.
// Phase 1: matrix 305 rows 147 cols
[2024-06-03 07:44:10] [INFO ] Computed 8 invariants in 4 ms
[2024-06-03 07:44:10] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-03 07:44:10] [INFO ] Invariant cache hit.
[2024-06-03 07:44:11] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-06-03 07:44:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 305/452 variables, 147/155 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-03 07:44:18] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 156 constraints, problems are : Problem set: 0 solved, 304 unsolved in 18563 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/452 variables, 147/156 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 304/460 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-03 07:44:36] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 3 ms to minimize.
[2024-06-03 07:44:36] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-03 07:44:55] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/452 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 463 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 4/4 constraints]
After SMT, in 48791ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 48797ms
Starting structural reductions in LTL mode, iteration 1 : 147/271 places, 305/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49396 ms. Remains : 147/271 places, 305/506 transitions.
[2024-06-03 07:45:00] [INFO ] Flatten gal took : 11 ms
[2024-06-03 07:45:00] [INFO ] Flatten gal took : 14 ms
[2024-06-03 07:45:00] [INFO ] Input system was already deterministic with 305 transitions.
[2024-06-03 07:45:00] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:45:00] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:45:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality8239330012757843439.gal : 3 ms
[2024-06-03 07:45:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality12983540796625829700.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8239330012757843439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12983540796625829700.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 07:45:30] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:45:30] [INFO ] Applying decomposition
[2024-06-03 07:45:30] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13268427590046472459.txt' '-o' '/tmp/graph13268427590046472459.bin' '-w' '/tmp/graph13268427590046472459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13268427590046472459.bin' '-l' '-1' '-v' '-w' '/tmp/graph13268427590046472459.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:45:30] [INFO ] Decomposing Gal with order
[2024-06-03 07:45:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:45:30] [INFO ] Removed a total of 443 redundant transitions.
[2024-06-03 07:45:30] [INFO ] Flatten gal took : 33 ms
[2024-06-03 07:45:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 6 ms.
[2024-06-03 07:45:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality11526951869615380863.gal : 5 ms
[2024-06-03 07:45:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality5186945659156395949.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11526951869615380863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5186945659156395949.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.8027e+09,1.92463,40104,1126,42,64408,472,537,142953,66,1170,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,1.93188,40104,1,0,64408,472,758,142953,79,1170,548
FORMULA MedleyA-PT-23-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Graph (trivial) has 222 edges and 271 vertex of which 30 / 271 are part of one of the 3 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 243 transition count 428
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 202 transition count 426
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 85 place count 202 transition count 423
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 199 transition count 423
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 138 place count 152 transition count 372
Iterating global reduction 2 with 47 rules applied. Total rules applied 185 place count 152 transition count 372
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 185 place count 152 transition count 365
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 199 place count 145 transition count 365
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 221 place count 123 transition count 299
Iterating global reduction 2 with 22 rules applied. Total rules applied 243 place count 123 transition count 299
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 253 place count 123 transition count 289
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 121 transition count 285
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 121 transition count 285
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 259 place count 119 transition count 279
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 119 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 263 place count 119 transition count 277
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 293 place count 104 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 294 place count 104 transition count 261
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 303 place count 95 transition count 234
Iterating global reduction 5 with 9 rules applied. Total rules applied 312 place count 95 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 313 place count 95 transition count 233
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 314 place count 94 transition count 231
Iterating global reduction 6 with 1 rules applied. Total rules applied 315 place count 94 transition count 231
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 316 place count 93 transition count 228
Iterating global reduction 6 with 1 rules applied. Total rules applied 317 place count 93 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 318 place count 93 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 324 place count 93 transition count 221
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 330 place count 90 transition count 218
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 333 place count 87 transition count 209
Iterating global reduction 7 with 3 rules applied. Total rules applied 336 place count 87 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 339 place count 87 transition count 206
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 341 place count 85 transition count 204
Applied a total of 341 rules in 90 ms. Remains 85 /271 variables (removed 186) and now considering 204/506 (removed 302) transitions.
[2024-06-03 07:45:32] [INFO ] Flow matrix only has 194 transitions (discarded 10 similar events)
// Phase 1: matrix 194 rows 85 cols
[2024-06-03 07:45:32] [INFO ] Computed 8 invariants in 1 ms
[2024-06-03 07:45:32] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-03 07:45:32] [INFO ] Flow matrix only has 194 transitions (discarded 10 similar events)
[2024-06-03 07:45:32] [INFO ] Invariant cache hit.
[2024-06-03 07:45:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 07:45:32] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-03 07:45:32] [INFO ] Redundant transitions in 8 ms returned []
Running 177 sub problems to find dead transitions.
[2024-06-03 07:45:32] [INFO ] Flow matrix only has 194 transitions (discarded 10 similar events)
[2024-06-03 07:45:32] [INFO ] Invariant cache hit.
[2024-06-03 07:45:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 193/275 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 3/278 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/278 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/279 variables, and 94 constraints, problems are : Problem set: 0 solved, 177 unsolved in 7282 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 193/275 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 3/278 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 136/271 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/278 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/279 variables, and 271 constraints, problems are : Problem set: 0 solved, 177 unsolved in 7905 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 15249ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 15251ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/271 places, 204/506 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15595 ms. Remains : 85/271 places, 204/506 transitions.
[2024-06-03 07:45:48] [INFO ] Flatten gal took : 5 ms
[2024-06-03 07:45:48] [INFO ] Flatten gal took : 6 ms
[2024-06-03 07:45:48] [INFO ] Input system was already deterministic with 204 transitions.
[2024-06-03 07:45:48] [INFO ] Flatten gal took : 6 ms
[2024-06-03 07:45:48] [INFO ] Flatten gal took : 6 ms
[2024-06-03 07:45:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5453125309287536430.gal : 4 ms
[2024-06-03 07:45:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality14933220945409726426.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5453125309287536430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14933220945409726426.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12259e+07,6.32293,115568,2,9702,5,356058,6,0,540,504851,0


Converting to forward existential form...Done !
original formula: AF(AG((((p7!=1) + ((p216!=1) * !(A((p370==0) U (p376==0))))) + ((p149==1) * AG((p337!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p7!=1) + ((p216!=1) * !(!((E(!((p376==0)) U (!((p370==0)) * !((p376==0)))) + EG(!((...227
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t7, t14, t15, t18, t23, t24, t31, t32, t34, t40, t43, t44, t51, t52, t62, t71, t80, t...506
Detected timeout of ITS tools.
[2024-06-03 07:46:18] [INFO ] Flatten gal took : 6 ms
[2024-06-03 07:46:18] [INFO ] Applying decomposition
[2024-06-03 07:46:18] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3143016357632620205.txt' '-o' '/tmp/graph3143016357632620205.bin' '-w' '/tmp/graph3143016357632620205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3143016357632620205.bin' '-l' '-1' '-v' '-w' '/tmp/graph3143016357632620205.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:46:18] [INFO ] Decomposing Gal with order
[2024-06-03 07:46:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:46:18] [INFO ] Removed a total of 321 redundant transitions.
[2024-06-03 07:46:18] [INFO ] Flatten gal took : 15 ms
[2024-06-03 07:46:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 4 ms.
[2024-06-03 07:46:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality6840889087161676809.gal : 2 ms
[2024-06-03 07:46:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality9511512469729372174.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6840889087161676809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9511512469729372174.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12259e+07,0.358065,8836,338,86,8935,791,437,16699,107,1831,0


Converting to forward existential form...Done !
original formula: AF(AG((((i0.u0.p7!=1) + ((i3.u9.p216!=1) * !(A((i8.u21.p370==0) U (i8.u22.p376==0))))) + ((i3.u8.p149==1) * AG((i6.u17.p337!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((i0.u0.p7!=1) + ((i3.u9.p216!=1) * !(!((E(!((i8.u22.p376==0)) U (!((i8.u21.p370==0))...280
Reverse transition relation is NOT exact ! Due to transitions t62, t71, t80, t88, t90, t91, t92, t93, t100, t101, t102, t118, t119, t120, t128, t129, t134,...535
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 221 transition count 456
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 221 transition count 456
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 129 place count 192 transition count 411
Iterating global reduction 0 with 29 rules applied. Total rules applied 158 place count 192 transition count 411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 159 place count 192 transition count 410
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 175 place count 176 transition count 374
Iterating global reduction 1 with 16 rules applied. Total rules applied 191 place count 176 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 193 place count 176 transition count 372
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 171 transition count 359
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 171 transition count 359
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 205 place count 171 transition count 357
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 207 place count 169 transition count 352
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 169 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 211 place count 169 transition count 350
Applied a total of 211 rules in 18 ms. Remains 169 /271 variables (removed 102) and now considering 350/506 (removed 156) transitions.
// Phase 1: matrix 350 rows 169 cols
[2024-06-03 07:46:48] [INFO ] Computed 8 invariants in 4 ms
[2024-06-03 07:46:48] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-03 07:46:48] [INFO ] Invariant cache hit.
[2024-06-03 07:46:48] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-06-03 07:46:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (OVERLAPS) 350/519 variables, 169/177 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-03 07:46:55] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (OVERLAPS) 0/519 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 349 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 178 constraints, problems are : Problem set: 0 solved, 349 unsolved in 16894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 350/519 variables, 169/178 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 349/527 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-03 07:47:12] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-03 07:47:18] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 529 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 3/3 constraints]
After SMT, in 47062ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 47066ms
Starting structural reductions in LTL mode, iteration 1 : 169/271 places, 350/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47506 ms. Remains : 169/271 places, 350/506 transitions.
[2024-06-03 07:47:35] [INFO ] Flatten gal took : 13 ms
[2024-06-03 07:47:35] [INFO ] Flatten gal took : 11 ms
[2024-06-03 07:47:35] [INFO ] Input system was already deterministic with 350 transitions.
[2024-06-03 07:47:35] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:47:35] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:47:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality11165105650822998107.gal : 4 ms
[2024-06-03 07:47:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13148550782966708905.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11165105650822998107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13148550782966708905.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 07:48:05] [INFO ] Flatten gal took : 14 ms
[2024-06-03 07:48:05] [INFO ] Applying decomposition
[2024-06-03 07:48:05] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11937453481053855685.txt' '-o' '/tmp/graph11937453481053855685.bin' '-w' '/tmp/graph11937453481053855685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11937453481053855685.bin' '-l' '-1' '-v' '-w' '/tmp/graph11937453481053855685.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:48:05] [INFO ] Decomposing Gal with order
[2024-06-03 07:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:48:05] [INFO ] Removed a total of 511 redundant transitions.
[2024-06-03 07:48:05] [INFO ] Flatten gal took : 23 ms
[2024-06-03 07:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2024-06-03 07:48:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality16538398281435059953.gal : 3 ms
[2024-06-03 07:48:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9563556444283789306.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16538398281435059953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9563556444283789306.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.393e+10,10.669,222816,1960,81,453651,963,683,644901,89,3934,0


Converting to forward existential form...Done !
original formula: (EG(AX((((i8.u46.p353==1)&&((i6.u36.p292==0)||(i2.u12.p101==1)))&&(i4.u39.p315==1)))) + (EG((((i3.u20.p151==0)||(i7.u42.p338==1)) * AF(((...355
=> equivalent forward existential formula: ([((Init * !(EG(!(EX(!((((i8.u46.p353==1)&&((i6.u36.p292==0)||(i2.u12.p101==1)))&&(i4.u39.p315==1)))))))) * !(EG...538
Reverse transition relation is NOT exact ! Due to transitions t20, t61, t138, t156, t158, t159, t166, t186, t194, t196, t197, t211, t219, t221, t222, t227,...951
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 236 transition count 471
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 236 transition count 471
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 92 place count 214 transition count 435
Iterating global reduction 0 with 22 rules applied. Total rules applied 114 place count 214 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 115 place count 214 transition count 434
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 125 place count 204 transition count 411
Iterating global reduction 1 with 10 rules applied. Total rules applied 135 place count 204 transition count 411
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 204 transition count 409
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 202 transition count 403
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 202 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 202 transition count 402
Applied a total of 142 rules in 10 ms. Remains 202 /271 variables (removed 69) and now considering 402/506 (removed 104) transitions.
// Phase 1: matrix 402 rows 202 cols
[2024-06-03 07:48:36] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:48:36] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-03 07:48:36] [INFO ] Invariant cache hit.
[2024-06-03 07:48:36] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-03 07:48:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (OVERLAPS) 402/604 variables, 202/210 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 07:48:48] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 211 constraints, problems are : Problem set: 0 solved, 401 unsolved in 27724 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (OVERLAPS) 402/604 variables, 202/211 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 401/612 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 07:49:12] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-03 07:49:24] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 614 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 3/3 constraints]
After SMT, in 57940ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 57945ms
Starting structural reductions in LTL mode, iteration 1 : 202/271 places, 402/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58399 ms. Remains : 202/271 places, 402/506 transitions.
[2024-06-03 07:49:34] [INFO ] Flatten gal took : 15 ms
[2024-06-03 07:49:34] [INFO ] Flatten gal took : 15 ms
[2024-06-03 07:49:34] [INFO ] Input system was already deterministic with 402 transitions.
[2024-06-03 07:49:34] [INFO ] Flatten gal took : 15 ms
[2024-06-03 07:49:34] [INFO ] Flatten gal took : 16 ms
[2024-06-03 07:49:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality6883928283383159197.gal : 4 ms
[2024-06-03 07:49:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6070374533845803158.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6883928283383159197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6070374533845803158.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 07:50:04] [INFO ] Flatten gal took : 9 ms
[2024-06-03 07:50:04] [INFO ] Applying decomposition
[2024-06-03 07:50:04] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1634313478019091755.txt' '-o' '/tmp/graph1634313478019091755.bin' '-w' '/tmp/graph1634313478019091755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1634313478019091755.bin' '-l' '-1' '-v' '-w' '/tmp/graph1634313478019091755.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:50:04] [INFO ] Decomposing Gal with order
[2024-06-03 07:50:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:50:04] [INFO ] Removed a total of 581 redundant transitions.
[2024-06-03 07:50:04] [INFO ] Flatten gal took : 27 ms
[2024-06-03 07:50:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-06-03 07:50:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11772775861606286925.gal : 5 ms
[2024-06-03 07:50:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality13519888671505078849.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11772775861606286925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13519888671505078849.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.46132e+10,5.90904,113816,2400,123,178646,1852,949,390867,114,7905,0


Converting to forward existential form...Done !
original formula: (A((((EF((i5.i4.u37.p184==0)) + !(AG((i5.i4.u37.p227==1)))) + ((AX(((i6.i0.u40.p246==0)||(i6.i2.u50.p316==1))) * (i6.i0.u38.p299==1)) + (...997
=> equivalent forward existential formula: (((([(FwdU((FwdU((FwdU(Init,!((!(E(TRUE U !((!((E(!((i7.i0.u58.p340==0)) U (!((i9.i0.u64.p367==0)) * !((i7.i0.u5...5883
Reverse transition relation is NOT exact ! Due to transitions t76, t167, t187, t189, t190, t197, t198, t200, t201, t220, t221, t223, t224, t231, t233, t234...1274
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Graph (trivial) has 232 edges and 271 vertex of which 33 / 271 are part of one of the 3 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 240 transition count 422
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 197 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 89 place count 197 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 195 transition count 418
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 142 place count 146 transition count 365
Iterating global reduction 2 with 49 rules applied. Total rules applied 191 place count 146 transition count 365
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 191 place count 146 transition count 358
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 205 place count 139 transition count 358
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 228 place count 116 transition count 289
Iterating global reduction 2 with 23 rules applied. Total rules applied 251 place count 116 transition count 289
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 262 place count 116 transition count 278
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 264 place count 114 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 266 place count 114 transition count 274
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 268 place count 112 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 270 place count 112 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 272 place count 112 transition count 266
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 304 place count 96 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 305 place count 96 transition count 249
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 314 place count 87 transition count 222
Iterating global reduction 5 with 9 rules applied. Total rules applied 323 place count 87 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 324 place count 87 transition count 221
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 325 place count 86 transition count 219
Iterating global reduction 6 with 1 rules applied. Total rules applied 326 place count 86 transition count 219
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 327 place count 85 transition count 216
Iterating global reduction 6 with 1 rules applied. Total rules applied 328 place count 85 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 329 place count 85 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 331 place count 84 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 337 place count 84 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 343 place count 81 transition count 205
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 346 place count 78 transition count 196
Iterating global reduction 7 with 3 rules applied. Total rules applied 349 place count 78 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 352 place count 78 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 354 place count 76 transition count 191
Applied a total of 354 rules in 64 ms. Remains 76 /271 variables (removed 195) and now considering 191/506 (removed 315) transitions.
[2024-06-03 07:50:34] [INFO ] Flow matrix only has 181 transitions (discarded 10 similar events)
// Phase 1: matrix 181 rows 76 cols
[2024-06-03 07:50:34] [INFO ] Computed 8 invariants in 1 ms
[2024-06-03 07:50:35] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-03 07:50:35] [INFO ] Flow matrix only has 181 transitions (discarded 10 similar events)
[2024-06-03 07:50:35] [INFO ] Invariant cache hit.
[2024-06-03 07:50:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 07:50:35] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-06-03 07:50:35] [INFO ] Redundant transitions in 3 ms returned []
Running 166 sub problems to find dead transitions.
[2024-06-03 07:50:35] [INFO ] Flow matrix only has 181 transitions (discarded 10 similar events)
[2024-06-03 07:50:35] [INFO ] Invariant cache hit.
[2024-06-03 07:50:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 180/253 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 3/256 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/257 variables, and 85 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 180/253 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 21/103 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 3/256 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 145/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/257 variables, and 251 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5503 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 11644ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 11646ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/271 places, 191/506 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12110 ms. Remains : 76/271 places, 191/506 transitions.
[2024-06-03 07:50:46] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:50:46] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:50:46] [INFO ] Input system was already deterministic with 191 transitions.
[2024-06-03 07:50:46] [INFO ] Flatten gal took : 11 ms
[2024-06-03 07:50:46] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:50:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality16947130807558834268.gal : 3 ms
[2024-06-03 07:50:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality4158640581957598824.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16947130807558834268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4158640581957598824.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.38606e+07,9.10986,172088,2,7155,5,448380,6,0,491,621028,0


Converting to forward existential form...Done !
original formula: EG(AG((p23==0)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((p23==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t12, t13, t16, t19, t20, t27, t28, t31, t34, t35, t42, t43, t70, t71, t72, t73, t...474
Detected timeout of ITS tools.
[2024-06-03 07:51:17] [INFO ] Flatten gal took : 6 ms
[2024-06-03 07:51:17] [INFO ] Applying decomposition
[2024-06-03 07:51:17] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13161339485665049982.txt' '-o' '/tmp/graph13161339485665049982.bin' '-w' '/tmp/graph13161339485665049982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13161339485665049982.bin' '-l' '-1' '-v' '-w' '/tmp/graph13161339485665049982.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:51:17] [INFO ] Decomposing Gal with order
[2024-06-03 07:51:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:51:17] [INFO ] Removed a total of 312 redundant transitions.
[2024-06-03 07:51:17] [INFO ] Flatten gal took : 11 ms
[2024-06-03 07:51:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 2 ms.
[2024-06-03 07:51:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality491894991273466098.gal : 2 ms
[2024-06-03 07:51:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality7873758948097448741.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality491894991273466098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7873758948097448741.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.38606e+07,0.151559,7404,244,98,7295,410,376,11855,98,1537,0


Converting to forward existential form...Done !
original formula: EG(AG((u2.p23==0)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((u2.p23==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t70, t71, t72, t82, t83, t84, t103, t104, t105, t128, t130, t133, t165, t167, t169, t171, t17...463
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,2.96906,72612,1,0,103631,7173,2005,345275,475,37116,208389
FORMULA MedleyA-PT-23-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 218 transition count 453
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 218 transition count 453
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 141 place count 183 transition count 400
Iterating global reduction 0 with 35 rules applied. Total rules applied 176 place count 183 transition count 400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 177 place count 183 transition count 399
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 198 place count 162 transition count 351
Iterating global reduction 1 with 21 rules applied. Total rules applied 219 place count 162 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 221 place count 162 transition count 349
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 230 place count 153 transition count 326
Iterating global reduction 2 with 9 rules applied. Total rules applied 239 place count 153 transition count 326
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 244 place count 153 transition count 321
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 248 place count 149 transition count 311
Iterating global reduction 3 with 4 rules applied. Total rules applied 252 place count 149 transition count 311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 256 place count 149 transition count 307
Applied a total of 256 rules in 11 ms. Remains 149 /271 variables (removed 122) and now considering 307/506 (removed 199) transitions.
// Phase 1: matrix 307 rows 149 cols
[2024-06-03 07:51:20] [INFO ] Computed 8 invariants in 6 ms
[2024-06-03 07:51:20] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-03 07:51:20] [INFO ] Invariant cache hit.
[2024-06-03 07:51:20] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-06-03 07:51:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/456 variables, 149/157 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-03 07:51:27] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 0/456 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 158 constraints, problems are : Problem set: 0 solved, 306 unsolved in 19920 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/456 variables, 149/158 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 306/464 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 464 constraints, problems are : Problem set: 0 solved, 306 unsolved in 23358 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 1/1 constraints]
After SMT, in 43448ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 43451ms
Starting structural reductions in LTL mode, iteration 1 : 149/271 places, 307/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43857 ms. Remains : 149/271 places, 307/506 transitions.
[2024-06-03 07:52:03] [INFO ] Flatten gal took : 11 ms
[2024-06-03 07:52:03] [INFO ] Flatten gal took : 12 ms
[2024-06-03 07:52:03] [INFO ] Input system was already deterministic with 307 transitions.
[2024-06-03 07:52:03] [INFO ] Flatten gal took : 12 ms
[2024-06-03 07:52:04] [INFO ] Flatten gal took : 12 ms
[2024-06-03 07:52:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality5392395056998573266.gal : 3 ms
[2024-06-03 07:52:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality5268945693472513218.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5392395056998573266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5268945693472513218.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 07:52:34] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:52:34] [INFO ] Applying decomposition
[2024-06-03 07:52:34] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10940746790245815562.txt' '-o' '/tmp/graph10940746790245815562.bin' '-w' '/tmp/graph10940746790245815562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10940746790245815562.bin' '-l' '-1' '-v' '-w' '/tmp/graph10940746790245815562.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:52:34] [INFO ] Decomposing Gal with order
[2024-06-03 07:52:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:52:34] [INFO ] Removed a total of 441 redundant transitions.
[2024-06-03 07:52:34] [INFO ] Flatten gal took : 17 ms
[2024-06-03 07:52:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2024-06-03 07:52:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality13571969320684758092.gal : 3 ms
[2024-06-03 07:52:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11752210193072456947.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13571969320684758092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11752210193072456947.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.63401e+09,3.82238,78788,1334,57,129172,729,675,252716,70,2243,0


Converting to forward existential form...Done !
original formula: E(!((EX(((i9.u44.p364==0)||(i2.u2.p7==1))) + EG((i7.u38.p338==0)))) U AG(((i6.u7.p28==0)||(i5.i0.u33.p276==1))))
=> equivalent forward existential formula: [(FwdU(Init,!((EX(((i9.u44.p364==0)||(i2.u2.p7==1))) + EG((i7.u38.p338==0))))) * !(E(TRUE U !(((i6.u7.p28==0)||(...188
Reverse transition relation is NOT exact ! Due to transitions t19, t52, t134, t136, t137, t170, t172, t173, t194, t196, t197, t202, t203, t204, t205, t207,...873
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 219 transition count 454
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 219 transition count 454
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 137 place count 186 transition count 405
Iterating global reduction 0 with 33 rules applied. Total rules applied 170 place count 186 transition count 405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 171 place count 186 transition count 404
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 191 place count 166 transition count 359
Iterating global reduction 1 with 20 rules applied. Total rules applied 211 place count 166 transition count 359
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 213 place count 166 transition count 357
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 221 place count 158 transition count 336
Iterating global reduction 2 with 8 rules applied. Total rules applied 229 place count 158 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 233 place count 158 transition count 332
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 237 place count 154 transition count 322
Iterating global reduction 3 with 4 rules applied. Total rules applied 241 place count 154 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 245 place count 154 transition count 318
Applied a total of 245 rules in 13 ms. Remains 154 /271 variables (removed 117) and now considering 318/506 (removed 188) transitions.
// Phase 1: matrix 318 rows 154 cols
[2024-06-03 07:53:04] [INFO ] Computed 8 invariants in 3 ms
[2024-06-03 07:53:04] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-03 07:53:04] [INFO ] Invariant cache hit.
[2024-06-03 07:53:04] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2024-06-03 07:53:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (OVERLAPS) 318/472 variables, 154/162 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-03 07:53:10] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (OVERLAPS) 0/472 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 163 constraints, problems are : Problem set: 0 solved, 317 unsolved in 17203 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 318/472 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 317/480 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-03 07:53:29] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-06-03 07:53:30] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-03 07:53:36] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 3 ms to minimize.
[2024-06-03 07:53:36] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-03 07:53:44] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 485 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 6/6 constraints]
After SMT, in 47342ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 47345ms
Starting structural reductions in LTL mode, iteration 1 : 154/271 places, 318/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47733 ms. Remains : 154/271 places, 318/506 transitions.
[2024-06-03 07:53:51] [INFO ] Flatten gal took : 12 ms
[2024-06-03 07:53:51] [INFO ] Flatten gal took : 12 ms
[2024-06-03 07:53:51] [INFO ] Input system was already deterministic with 318 transitions.
[2024-06-03 07:53:51] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:53:52] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:53:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality6235836702580242723.gal : 3 ms
[2024-06-03 07:53:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality12631934561362851306.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6235836702580242723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12631934561362851306.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 07:54:22] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:54:22] [INFO ] Applying decomposition
[2024-06-03 07:54:22] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3011998647069711556.txt' '-o' '/tmp/graph3011998647069711556.bin' '-w' '/tmp/graph3011998647069711556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3011998647069711556.bin' '-l' '-1' '-v' '-w' '/tmp/graph3011998647069711556.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:54:22] [INFO ] Decomposing Gal with order
[2024-06-03 07:54:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:54:22] [INFO ] Removed a total of 461 redundant transitions.
[2024-06-03 07:54:22] [INFO ] Flatten gal took : 19 ms
[2024-06-03 07:54:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-06-03 07:54:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality14858822043252264842.gal : 3 ms
[2024-06-03 07:54:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality2716298341594672340.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14858822043252264842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2716298341594672340.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.44759e+09,5.16191,109908,1765,62,179868,1185,582,387092,70,4443,0


Converting to forward existential form...Done !
original formula: (AF(!(E(!((AF((i4.u22.p185==0)) + ((i9.u45.p366==0)&&(i5.u29.p305==1)))) U AG((((i5.u29.p304==0)||(i4.u18.p170==1))||(i5.u29.p305==1)))))...222
=> equivalent forward existential formula: [(EY((Init * !(!(EG(!(!(E(!((!(EG(!((i4.u22.p185==0)))) + ((i9.u45.p366==0)&&(i5.u29.p305==1)))) U !(E(TRUE U !(...302
Reverse transition relation is NOT exact ! Due to transitions t19, t56, t139, t142, t143, t176, t179, t180, t201, t204, t205, t217, t218, t219, t220, t221,...905
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Graph (trivial) has 224 edges and 271 vertex of which 33 / 271 are part of one of the 3 SCC in 0 ms
Free SCC test removed 30 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 240 transition count 425
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 200 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 83 place count 200 transition count 421
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 198 transition count 421
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 133 place count 152 transition count 371
Iterating global reduction 2 with 46 rules applied. Total rules applied 179 place count 152 transition count 371
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 179 place count 152 transition count 364
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 193 place count 145 transition count 364
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 213 place count 125 transition count 304
Iterating global reduction 2 with 20 rules applied. Total rules applied 233 place count 125 transition count 304
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 242 place count 125 transition count 295
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 243 place count 124 transition count 293
Iterating global reduction 3 with 1 rules applied. Total rules applied 244 place count 124 transition count 293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 123 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 123 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 123 transition count 289
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 279 place count 107 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 280 place count 107 transition count 272
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 288 place count 99 transition count 248
Iterating global reduction 5 with 8 rules applied. Total rules applied 296 place count 99 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 297 place count 99 transition count 247
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 299 place count 98 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 305 place count 98 transition count 240
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 311 place count 95 transition count 237
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 314 place count 92 transition count 228
Iterating global reduction 6 with 3 rules applied. Total rules applied 317 place count 92 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 320 place count 92 transition count 225
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 322 place count 92 transition count 225
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 324 place count 90 transition count 223
Applied a total of 324 rules in 95 ms. Remains 90 /271 variables (removed 181) and now considering 223/506 (removed 283) transitions.
[2024-06-03 07:54:52] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
// Phase 1: matrix 214 rows 90 cols
[2024-06-03 07:54:52] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:54:52] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-03 07:54:52] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
[2024-06-03 07:54:52] [INFO ] Invariant cache hit.
[2024-06-03 07:54:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 07:54:52] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-06-03 07:54:52] [INFO ] Redundant transitions in 4 ms returned []
Running 193 sub problems to find dead transitions.
[2024-06-03 07:54:52] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
[2024-06-03 07:54:52] [INFO ] Invariant cache hit.
[2024-06-03 07:54:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 212/299 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 4/303 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/304 variables, and 99 constraints, problems are : Problem set: 0 solved, 193 unsolved in 6366 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 212/299 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 25/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 4/303 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 168/292 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/304 variables, and 292 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7795 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 14276ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 14279ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/271 places, 223/506 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14789 ms. Remains : 90/271 places, 223/506 transitions.
[2024-06-03 07:55:07] [INFO ] Flatten gal took : 5 ms
[2024-06-03 07:55:07] [INFO ] Flatten gal took : 6 ms
[2024-06-03 07:55:07] [INFO ] Input system was already deterministic with 223 transitions.
[2024-06-03 07:55:07] [INFO ] Flatten gal took : 5 ms
[2024-06-03 07:55:07] [INFO ] Flatten gal took : 5 ms
[2024-06-03 07:55:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality14041132496608696153.gal : 2 ms
[2024-06-03 07:55:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality6093218167138905641.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14041132496608696153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6093218167138905641.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22706e+07,19.8423,381952,2,10792,5,825473,6,0,579,1.30768e+06,0


Converting to forward existential form...Done !
original formula: AF(AG(!(E(!((((p39==0)||(p266==1))||(p298==0))) U A(((p368==0)||(p85==1)) U (p97==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(E(!((((p39==0)||(p266==1))||(p298==0))) U !((E(!((p97==1)) U (!(((p368==0)||(p85==1)...209
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t12, t13, t21, t24, t25, t32, t33, t36, t39, t40, t44, t46, t49, t53, t54, t56, t...512
Detected timeout of ITS tools.
[2024-06-03 07:55:37] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:55:37] [INFO ] Applying decomposition
[2024-06-03 07:55:37] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4366692506659302403.txt' '-o' '/tmp/graph4366692506659302403.bin' '-w' '/tmp/graph4366692506659302403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4366692506659302403.bin' '-l' '-1' '-v' '-w' '/tmp/graph4366692506659302403.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:55:37] [INFO ] Decomposing Gal with order
[2024-06-03 07:55:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:55:37] [INFO ] Removed a total of 368 redundant transitions.
[2024-06-03 07:55:37] [INFO ] Flatten gal took : 21 ms
[2024-06-03 07:55:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 5 ms.
[2024-06-03 07:55:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality5551489392852772100.gal : 3 ms
[2024-06-03 07:55:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality5062257411177743709.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5551489392852772100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5062257411177743709.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22706e+07,0.268789,10532,379,128,12045,976,446,24532,103,2994,0


Converting to forward existential form...Done !
original formula: AF(AG(!(E(!((((i2.u4.p39==0)||(i5.u15.p266==1))||(i5.u17.p298==0))) U A(((i8.u23.p368==0)||(i2.u6.p85==1)) U (i2.u7.p97==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(E(!((((i2.u4.p39==0)||(i5.u15.p266==1))||(i5.u17.p298==0))) U !((E(!((i2.u7.p97==1))...260
Reverse transition relation is NOT exact ! Due to transitions t91, t92, t93, t103, t105, t106, t107, t108, t127, t128, t129, t130, t131, t132, t150, t152, ...590
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Graph (trivial) has 224 edges and 271 vertex of which 33 / 271 are part of one of the 3 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 240 transition count 430
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 205 transition count 426
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 203 transition count 426
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 77 place count 203 transition count 422
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 85 place count 199 transition count 422
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 130 place count 154 transition count 373
Iterating global reduction 3 with 45 rules applied. Total rules applied 175 place count 154 transition count 373
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 175 place count 154 transition count 365
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 191 place count 146 transition count 365
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 209 place count 128 transition count 311
Iterating global reduction 3 with 18 rules applied. Total rules applied 227 place count 128 transition count 311
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 235 place count 128 transition count 303
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 236 place count 127 transition count 301
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 127 transition count 301
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 238 place count 126 transition count 298
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 126 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 126 transition count 297
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 270 place count 111 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 271 place count 111 transition count 281
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 280 place count 102 transition count 254
Iterating global reduction 6 with 9 rules applied. Total rules applied 289 place count 102 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 290 place count 102 transition count 253
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 291 place count 101 transition count 251
Iterating global reduction 7 with 1 rules applied. Total rules applied 292 place count 101 transition count 251
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 293 place count 100 transition count 248
Iterating global reduction 7 with 1 rules applied. Total rules applied 294 place count 100 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 295 place count 100 transition count 247
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 297 place count 99 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 303 place count 99 transition count 240
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 309 place count 96 transition count 237
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 312 place count 93 transition count 228
Iterating global reduction 8 with 3 rules applied. Total rules applied 315 place count 93 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 318 place count 93 transition count 225
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 320 place count 91 transition count 223
Applied a total of 320 rules in 76 ms. Remains 91 /271 variables (removed 180) and now considering 223/506 (removed 283) transitions.
[2024-06-03 07:56:07] [INFO ] Flow matrix only has 213 transitions (discarded 10 similar events)
// Phase 1: matrix 213 rows 91 cols
[2024-06-03 07:56:07] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 07:56:07] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-03 07:56:07] [INFO ] Flow matrix only has 213 transitions (discarded 10 similar events)
[2024-06-03 07:56:07] [INFO ] Invariant cache hit.
[2024-06-03 07:56:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 07:56:07] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-06-03 07:56:07] [INFO ] Redundant transitions in 2 ms returned []
Running 195 sub problems to find dead transitions.
[2024-06-03 07:56:07] [INFO ] Flow matrix only has 213 transitions (discarded 10 similar events)
[2024-06-03 07:56:07] [INFO ] Invariant cache hit.
[2024-06-03 07:56:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 212/300 variables, 88/96 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 3/303 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/304 variables, and 100 constraints, problems are : Problem set: 0 solved, 195 unsolved in 8904 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 212/300 variables, 88/96 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 26/123 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 3/303 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 169/295 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/304 variables, and 295 constraints, problems are : Problem set: 0 solved, 195 unsolved in 9997 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 18988ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 18991ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/271 places, 223/506 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19428 ms. Remains : 91/271 places, 223/506 transitions.
[2024-06-03 07:56:26] [INFO ] Flatten gal took : 6 ms
[2024-06-03 07:56:26] [INFO ] Flatten gal took : 5 ms
[2024-06-03 07:56:26] [INFO ] Input system was already deterministic with 223 transitions.
[2024-06-03 07:56:26] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:56:26] [INFO ] Flatten gal took : 5 ms
[2024-06-03 07:56:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality4332663744986576244.gal : 7 ms
[2024-06-03 07:56:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality18102580754656013962.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4332663744986576244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18102580754656013962.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08753e+07,10.5001,188136,2,11796,5,489515,6,0,583,678412,0


Converting to forward existential form...Done !
original formula: EF(!(A(EF(EG((p268==1))) U ((!(AG((p255==0))) * ((p138==0)||(p117==1))) + !((AG((p191==0)) * (p357!=1)))))))
=> equivalent forward existential formula: (([(((FwdU(FwdU(Init,TRUE),!(((!(!(E(TRUE U !((p255==0))))) * ((p138==0)||(p117==1))) + !((!(E(TRUE U !((p191==0...689
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t13, t14, t16, t19, t22, t23, t29, t30, t35, t36, t39, t42, t46, t53, t54, t83, t...523
Detected timeout of ITS tools.
[2024-06-03 07:56:56] [INFO ] Flatten gal took : 6 ms
[2024-06-03 07:56:56] [INFO ] Applying decomposition
[2024-06-03 07:56:56] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11746857702774418820.txt' '-o' '/tmp/graph11746857702774418820.bin' '-w' '/tmp/graph11746857702774418820.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11746857702774418820.bin' '-l' '-1' '-v' '-w' '/tmp/graph11746857702774418820.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:56:56] [INFO ] Decomposing Gal with order
[2024-06-03 07:56:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:56:56] [INFO ] Removed a total of 364 redundant transitions.
[2024-06-03 07:56:56] [INFO ] Flatten gal took : 12 ms
[2024-06-03 07:56:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 4 ms.
[2024-06-03 07:56:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality13693619293414807781.gal : 2 ms
[2024-06-03 07:56:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality13045132437113479998.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13693619293414807781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13045132437113479998.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08753e+07,0.297663,10500,444,134,11902,733,427,25313,111,2057,0


Converting to forward existential form...Done !
original formula: EF(!(A(EF(EG((i5.u14.p268==1))) U ((!(AG((i5.u13.p255==0))) * ((i3.u7.p138==0)||(i1.u5.p117==1))) + !((AG((i3.u9.p191==0)) * (i7.u20.p357...165
=> equivalent forward existential formula: (([(((FwdU(FwdU(Init,TRUE),!(((!(!(E(TRUE U !((i5.u13.p255==0))))) * ((i3.u7.p138==0)||(i1.u5.p117==1))) + !((!(...844
Reverse transition relation is NOT exact ! Due to transitions t86, t87, t88, t101, t102, t103, t116, t117, t118, t119, t120, t121, t149, t151, t152, t153, ...570
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,18.2512,393552,1,0,511131,70181,2432,1.87286e+06,592,582109,916043
FORMULA MedleyA-PT-23-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 506/506 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 223 transition count 458
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 223 transition count 458
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 125 place count 194 transition count 411
Iterating global reduction 0 with 29 rules applied. Total rules applied 154 place count 194 transition count 411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 155 place count 194 transition count 410
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 168 place count 181 transition count 381
Iterating global reduction 1 with 13 rules applied. Total rules applied 181 place count 181 transition count 381
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 186 place count 176 transition count 368
Iterating global reduction 1 with 5 rules applied. Total rules applied 191 place count 176 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 193 place count 176 transition count 366
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 195 place count 174 transition count 361
Iterating global reduction 2 with 2 rules applied. Total rules applied 197 place count 174 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 199 place count 174 transition count 359
Applied a total of 199 rules in 31 ms. Remains 174 /271 variables (removed 97) and now considering 359/506 (removed 147) transitions.
// Phase 1: matrix 359 rows 174 cols
[2024-06-03 07:57:15] [INFO ] Computed 8 invariants in 3 ms
[2024-06-03 07:57:15] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-03 07:57:15] [INFO ] Invariant cache hit.
[2024-06-03 07:57:15] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2024-06-03 07:57:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (OVERLAPS) 359/533 variables, 174/182 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-03 07:57:26] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (OVERLAPS) 0/533 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 358 unsolved
No progress, stopping.
After SMT solving in domain Real declared 533/533 variables, and 183 constraints, problems are : Problem set: 0 solved, 358 unsolved in 27525 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (OVERLAPS) 359/533 variables, 174/183 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 358/541 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-03 07:57:52] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-06-03 07:57:52] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-03 07:58:06] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/533 variables, and 544 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 4/4 constraints]
After SMT, in 57795ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 57801ms
Starting structural reductions in LTL mode, iteration 1 : 174/271 places, 359/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58322 ms. Remains : 174/271 places, 359/506 transitions.
[2024-06-03 07:58:13] [INFO ] Flatten gal took : 7 ms
[2024-06-03 07:58:13] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:58:13] [INFO ] Input system was already deterministic with 359 transitions.
[2024-06-03 07:58:13] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:58:13] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:58:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality495781707289447879.gal : 2 ms
[2024-06-03 07:58:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality6569163782055789688.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality495781707289447879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6569163782055789688.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 07:58:43] [INFO ] Flatten gal took : 8 ms
[2024-06-03 07:58:43] [INFO ] Applying decomposition
[2024-06-03 07:58:43] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2310892055210750056.txt' '-o' '/tmp/graph2310892055210750056.bin' '-w' '/tmp/graph2310892055210750056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2310892055210750056.bin' '-l' '-1' '-v' '-w' '/tmp/graph2310892055210750056.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:58:43] [INFO ] Decomposing Gal with order
[2024-06-03 07:58:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:58:43] [INFO ] Removed a total of 504 redundant transitions.
[2024-06-03 07:58:43] [INFO ] Flatten gal took : 17 ms
[2024-06-03 07:58:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2024-06-03 07:58:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10123911039508473536.gal : 3 ms
[2024-06-03 07:58:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4377046186290584080.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10123911039508473536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4377046186290584080.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.59086e+10,10.6666,209764,2581,65,363844,821,776,708531,85,2745,0


Converting to forward existential form...Done !
original formula: A(AX((((i3.u12.p81==0)||(i0.i1.u15.p123==1)) + !(((((i3.u16.p124==1)||(i4.u24.p192==0)) * EF(((i7.i1.u47.p342==0)||(i6.i2.u33.p253==1))))...360
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U !((E(TRUE U (i6.i2.u43.p306==1)) * !(!(EX(!((i6.i2.u38.p281==1)))))))) + (E(((i3.u8.p...851
Reverse transition relation is NOT exact ! Due to transitions t20, t61, t147, t165, t167, t168, t169, t206, t208, t209, t210, t233, t235, t236, t237, t242,...1006
Detected timeout of ITS tools.
[2024-06-03 07:59:13] [INFO ] Flatten gal took : 12 ms
[2024-06-03 07:59:13] [INFO ] Flatten gal took : 13 ms
[2024-06-03 07:59:13] [INFO ] Applying decomposition
[2024-06-03 07:59:13] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1451311765777716446.txt' '-o' '/tmp/graph1451311765777716446.bin' '-w' '/tmp/graph1451311765777716446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1451311765777716446.bin' '-l' '-1' '-v' '-w' '/tmp/graph1451311765777716446.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:59:13] [INFO ] Decomposing Gal with order
[2024-06-03 07:59:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:59:13] [INFO ] Removed a total of 715 redundant transitions.
[2024-06-03 07:59:13] [INFO ] Flatten gal took : 25 ms
[2024-06-03 07:59:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 6 ms.
[2024-06-03 07:59:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality8711261438903377029.gal : 4 ms
[2024-06-03 07:59:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality5609791818922565414.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8711261438903377029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5609791818922565414.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12036e+11,52.7052,898664,8656,104,1.4153e+06,1585,1139,3.07266e+06,109,5323,0


Converting to forward existential form...Done !
original formula: (A((((EF((i2.i3.u16.p70==1)) + AF(((i2.i3.u15.p67==0)||(i8.i0.u93.p368==1)))) * (((i2.i0.u19.p78==0)||(i0.u8.p30==1)) + (((i2.i1.u17.p72=...518
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(!((E(TRUE U (((i3.i0.u34.p195==0)||(i0.u8.p29==1))&&((i2.i0.u32.p133==0)||(i6.i3.u79.p318=...899
Reverse transition relation is NOT exact ! Due to transitions t66, t96, t105, t228, t231, t238, t249, t252, t253, t254, t261, t262, t264, t265, t266, t267,...1521
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-06-03 08:13:09] [INFO ] Applying decomposition
[2024-06-03 08:13:09] [INFO ] Flatten gal took : 12 ms
[2024-06-03 08:13:09] [INFO ] Decomposing Gal with order
[2024-06-03 08:13:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 08:13:09] [INFO ] Removed a total of 499 redundant transitions.
[2024-06-03 08:13:09] [INFO ] Flatten gal took : 26 ms
[2024-06-03 08:13:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 297 labels/synchronizations in 8 ms.
[2024-06-03 08:13:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality15105288049553267496.gal : 5 ms
[2024-06-03 08:13:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality16417728749361832848.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15105288049553267496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16417728749361832848.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12036e+11,225.848,4056476,4276,7885,4.85468e+06,745609,325,2.19936e+07,603,1.90676e+07,0


Converting to forward existential form...Done !
original formula: (A((((EF((i0.i1.i0.u11.p70==1)) + AF(((i0.i1.i0.u11.p67==0)||(i1.u18.p368==1)))) * (((i0.i1.i0.u11.p78==0)||(i0.i0.i1.u8.p30==1)) + (((i0...575
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(!((E(TRUE U (((i0.i1.i0.u12.p195==0)||(i0.i0.i1.u8.p29==1))&&((i0.i1.i0.u11.p133==0)||(i0....998
Reverse transition relation is NOT exact ! Due to transitions t250, t268, t293, t300, i0.t441, i0.t401, i0.i0.t228, i0.i0.u3.t240, i0.i0.u3.t242, i0.i0.u3....1512
ITS-tools command line returned an error code 137
[2024-06-03 08:32:34] [INFO ] Flatten gal took : 28 ms
[2024-06-03 08:32:34] [INFO ] Input system was already deterministic with 506 transitions.
[2024-06-03 08:32:34] [INFO ] Transformed 271 places.
[2024-06-03 08:32:34] [INFO ] Transformed 506 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-06-03 08:32:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality17770994853643061665.gal : 3 ms
[2024-06-03 08:32:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11851220525220275238.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17770994853643061665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11851220525220275238.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-23, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920200177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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