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.r131-smll-171624288400138.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 gold2023
Input is DLCround-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288400138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 13 13:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 13 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 13 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716396487322

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-09b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 16:48:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 16:48:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:48:10] [INFO ] Load time of PNML (sax parser for PT used): 387 ms
[2024-05-22 16:48:10] [INFO ] Transformed 3495 places.
[2024-05-22 16:48:10] [INFO ] Transformed 5439 transitions.
[2024-05-22 16:48:10] [INFO ] Found NUPN structural information;
[2024-05-22 16:48:10] [INFO ] Parsed PT model containing 3495 places and 5439 transitions and 15081 arcs in 629 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-09b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 3495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Discarding 617 places :
Symmetric choice reduction at 0 with 617 rule applications. Total rules 617 place count 2878 transition count 4822
Iterating global reduction 0 with 617 rules applied. Total rules applied 1234 place count 2878 transition count 4822
Discarding 498 places :
Symmetric choice reduction at 0 with 498 rule applications. Total rules 1732 place count 2380 transition count 4324
Iterating global reduction 0 with 498 rules applied. Total rules applied 2230 place count 2380 transition count 4324
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 2239 place count 2380 transition count 4315
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 2307 place count 2312 transition count 4123
Iterating global reduction 1 with 68 rules applied. Total rules applied 2375 place count 2312 transition count 4123
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 2413 place count 2274 transition count 4085
Iterating global reduction 1 with 38 rules applied. Total rules applied 2451 place count 2274 transition count 4085
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 2455 place count 2274 transition count 4081
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2477 place count 2252 transition count 4059
Iterating global reduction 2 with 22 rules applied. Total rules applied 2499 place count 2252 transition count 4059
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2521 place count 2230 transition count 4037
Iterating global reduction 2 with 22 rules applied. Total rules applied 2543 place count 2230 transition count 4037
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2565 place count 2208 transition count 4015
Iterating global reduction 2 with 22 rules applied. Total rules applied 2587 place count 2208 transition count 4015
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2599 place count 2196 transition count 4003
Iterating global reduction 2 with 12 rules applied. Total rules applied 2611 place count 2196 transition count 4003
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2618 place count 2189 transition count 3996
Iterating global reduction 2 with 7 rules applied. Total rules applied 2625 place count 2189 transition count 3996
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2632 place count 2182 transition count 3989
Iterating global reduction 2 with 7 rules applied. Total rules applied 2639 place count 2182 transition count 3989
Applied a total of 2639 rules in 2370 ms. Remains 2182 /3495 variables (removed 1313) and now considering 3989/5439 (removed 1450) transitions.
// Phase 1: matrix 3989 rows 2182 cols
[2024-05-22 16:48:13] [INFO ] Computed 184 invariants in 58 ms
[2024-05-22 16:48:14] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2024-05-22 16:48:14] [INFO ] Invariant cache hit.
[2024-05-22 16:48:16] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 3081 ms to find 0 implicit places.
[2024-05-22 16:48:16] [INFO ] Invariant cache hit.
[2024-05-22 16:48:20] [INFO ] Dead Transitions using invariants and state equation in 3633 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2182/3495 places, 3989/5439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9093 ms. Remains : 2182/3495 places, 3989/5439 transitions.
Support contains 41 out of 2182 places after structural reductions.
[2024-05-22 16:48:20] [INFO ] Flatten gal took : 342 ms
[2024-05-22 16:48:20] [INFO ] Flatten gal took : 207 ms
[2024-05-22 16:48:21] [INFO ] Input system was already deterministic with 3989 transitions.
Support contains 40 out of 2182 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 803 ms. (steps per millisecond=12 ) properties (out of 30) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-22 16:48:22] [INFO ] Invariant cache hit.
[2024-05-22 16:48:23] [INFO ] [Real]Absence check using 184 positive place invariants in 199 ms returned sat
[2024-05-22 16:48:24] [INFO ] After 1329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-22 16:48:25] [INFO ] [Nat]Absence check using 184 positive place invariants in 187 ms returned sat
[2024-05-22 16:48:28] [INFO ] After 3072ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-22 16:48:31] [INFO ] After 5808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1380 ms.
[2024-05-22 16:48:32] [INFO ] After 8649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 8 properties in 252 ms.
Support contains 6 out of 2182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Graph (trivial) has 1920 edges and 2182 vertex of which 530 / 2182 are part of one of the 44 SCC in 18 ms
Free SCC test removed 486 places
Drop transitions removed 554 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 568 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 1696 transition count 3084
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 380 rules applied. Total rules applied 718 place count 1359 transition count 3041
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 746 place count 1331 transition count 3041
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 746 place count 1331 transition count 2862
Deduced a syphon composed of 179 places in 15 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1104 place count 1152 transition count 2862
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 1174 place count 1082 transition count 2312
Iterating global reduction 3 with 70 rules applied. Total rules applied 1244 place count 1082 transition count 2312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1248 place count 1082 transition count 2308
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1248 place count 1082 transition count 2304
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1256 place count 1078 transition count 2304
Performed 414 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 414 places in 1 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 4 with 828 rules applied. Total rules applied 2084 place count 664 transition count 1880
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2094 place count 664 transition count 1870
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2118 place count 640 transition count 1570
Iterating global reduction 5 with 24 rules applied. Total rules applied 2142 place count 640 transition count 1570
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2166 place count 640 transition count 1546
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -407
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 2244 place count 601 transition count 1953
Drop transitions removed 13 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2261 place count 601 transition count 1936
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2282 place count 580 transition count 1409
Iterating global reduction 7 with 21 rules applied. Total rules applied 2303 place count 580 transition count 1409
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 2324 place count 580 transition count 1388
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2332 place count 576 transition count 1421
Drop transitions removed 150 transitions
Redundant transition composition rules discarded 150 transitions
Iterating global reduction 8 with 150 rules applied. Total rules applied 2482 place count 576 transition count 1271
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 2492 place count 566 transition count 1140
Iterating global reduction 8 with 10 rules applied. Total rules applied 2502 place count 566 transition count 1140
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 2512 place count 566 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2520 place count 562 transition count 1157
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2525 place count 562 transition count 1152
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 2547 place count 562 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2555 place count 558 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2561 place count 558 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 2582 place count 558 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2590 place count 554 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2596 place count 554 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 2617 place count 554 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2625 place count 550 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2631 place count 550 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 2652 place count 550 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2660 place count 546 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2666 place count 546 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 2687 place count 546 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2695 place count 542 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2701 place count 542 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 2722 place count 542 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2730 place count 538 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2736 place count 538 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 2757 place count 538 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2765 place count 534 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2771 place count 534 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 2792 place count 534 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2800 place count 530 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2806 place count 530 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2827 place count 530 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2835 place count 526 transition count 1159
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 2842 place count 526 transition count 1152
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 19 with 20 rules applied. Total rules applied 2862 place count 526 transition count 1132
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2870 place count 522 transition count 1163
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2876 place count 522 transition count 1157
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2897 place count 522 transition count 1136
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2905 place count 518 transition count 1167
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2911 place count 518 transition count 1161
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2932 place count 518 transition count 1140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2940 place count 514 transition count 1171
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2946 place count 514 transition count 1165
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2967 place count 514 transition count 1144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2975 place count 510 transition count 1171
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2981 place count 510 transition count 1165
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 3002 place count 510 transition count 1144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 3010 place count 506 transition count 1171
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 3016 place count 506 transition count 1165
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 3037 place count 506 transition count 1144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 3045 place count 502 transition count 1171
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 3051 place count 502 transition count 1165
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 25 with 21 rules applied. Total rules applied 3072 place count 502 transition count 1144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 16 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 3080 place count 498 transition count 1171
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 3086 place count 498 transition count 1165
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 26 with 21 rules applied. Total rules applied 3107 place count 498 transition count 1144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 3115 place count 494 transition count 1175
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 3121 place count 494 transition count 1169
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 27 with 21 rules applied. Total rules applied 3142 place count 494 transition count 1148
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 3150 place count 490 transition count 1177
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 27 with 5 rules applied. Total rules applied 3155 place count 490 transition count 1172
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 28 with 21 rules applied. Total rules applied 3176 place count 490 transition count 1151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 3184 place count 486 transition count 1170
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 3188 place count 486 transition count 1166
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 3207 place count 486 transition count 1147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 3215 place count 482 transition count 1166
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 3219 place count 482 transition count 1162
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 3238 place count 482 transition count 1143
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 3246 place count 478 transition count 1162
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 3250 place count 478 transition count 1158
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 3269 place count 478 transition count 1139
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 3277 place count 474 transition count 1158
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 3281 place count 474 transition count 1154
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 3300 place count 474 transition count 1135
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 3308 place count 470 transition count 1154
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 3312 place count 470 transition count 1150
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 3331 place count 470 transition count 1131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 3339 place count 466 transition count 1150
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 3343 place count 466 transition count 1146
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 3362 place count 466 transition count 1127
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 3370 place count 462 transition count 1146
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 3374 place count 462 transition count 1142
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 3393 place count 462 transition count 1123
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 3401 place count 458 transition count 1142
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 3405 place count 458 transition count 1138
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 36 with 19 rules applied. Total rules applied 3424 place count 458 transition count 1119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 3432 place count 454 transition count 1138
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 3436 place count 454 transition count 1134
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 3455 place count 454 transition count 1115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 37 with 8 rules applied. Total rules applied 3463 place count 450 transition count 1134
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 3467 place count 450 transition count 1130
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 38 with 19 rules applied. Total rules applied 3486 place count 450 transition count 1111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 38 with 8 rules applied. Total rules applied 3494 place count 446 transition count 1130
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 3498 place count 446 transition count 1126
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 39 with 19 rules applied. Total rules applied 3517 place count 446 transition count 1107
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 39 with 8 rules applied. Total rules applied 3525 place count 442 transition count 1134
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3529 place count 442 transition count 1130
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 40 with 19 rules applied. Total rules applied 3548 place count 442 transition count 1111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 40 with 8 rules applied. Total rules applied 3556 place count 438 transition count 1138
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 3560 place count 438 transition count 1134
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 41 with 19 rules applied. Total rules applied 3579 place count 438 transition count 1115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 41 with 8 rules applied. Total rules applied 3587 place count 434 transition count 1142
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 3591 place count 434 transition count 1138
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 42 with 19 rules applied. Total rules applied 3610 place count 434 transition count 1119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 42 with 8 rules applied. Total rules applied 3618 place count 430 transition count 1146
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 3622 place count 430 transition count 1142
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 43 with 19 rules applied. Total rules applied 3641 place count 430 transition count 1123
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 43 with 8 rules applied. Total rules applied 3649 place count 426 transition count 1144
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 43 with 4 rules applied. Total rules applied 3653 place count 426 transition count 1140
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 44 with 19 rules applied. Total rules applied 3672 place count 426 transition count 1121
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 44 with 8 rules applied. Total rules applied 3680 place count 422 transition count 1140
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 44 with 4 rules applied. Total rules applied 3684 place count 422 transition count 1136
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 45 with 19 rules applied. Total rules applied 3703 place count 422 transition count 1117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 45 with 8 rules applied. Total rules applied 3711 place count 418 transition count 1136
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 45 with 4 rules applied. Total rules applied 3715 place count 418 transition count 1132
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 46 with 19 rules applied. Total rules applied 3734 place count 418 transition count 1113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 46 with 8 rules applied. Total rules applied 3742 place count 414 transition count 1132
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 3746 place count 414 transition count 1128
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 47 with 19 rules applied. Total rules applied 3765 place count 414 transition count 1109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 8 rules applied. Total rules applied 3773 place count 410 transition count 1130
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 47 with 4 rules applied. Total rules applied 3777 place count 410 transition count 1126
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 48 with 19 rules applied. Total rules applied 3796 place count 410 transition count 1107
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 48 with 8 rules applied. Total rules applied 3804 place count 406 transition count 1134
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 3808 place count 406 transition count 1130
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 49 with 19 rules applied. Total rules applied 3827 place count 406 transition count 1111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 49 with 6 rules applied. Total rules applied 3833 place count 403 transition count 1127
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 3836 place count 403 transition count 1124
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 50 with 10 rules applied. Total rules applied 3846 place count 403 transition count 1114
Free-agglomeration rule applied 38 times with reduction of 4 identical transitions.
Iterating global reduction 50 with 38 rules applied. Total rules applied 3884 place count 403 transition count 1072
Reduce places removed 38 places and 0 transitions.
Drop transitions removed 376 transitions
Reduce isomorphic transitions removed 376 transitions.
Graph (complete) has 1079 edges and 365 vertex of which 239 are kept as prefixes of interest. Removing 126 places using SCC suffix rule.2 ms
Discarding 126 places :
Also discarding 0 output transitions
Iterating post reduction 50 with 415 rules applied. Total rules applied 4299 place count 239 transition count 696
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 51 with 126 rules applied. Total rules applied 4425 place count 239 transition count 570
Drop transitions removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 52 with 79 rules applied. Total rules applied 4504 place count 239 transition count 491
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 52 with 1 rules applied. Total rules applied 4505 place count 238 transition count 490
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 52 with 7 rules applied. Total rules applied 4512 place count 231 transition count 490
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 53 with 84 rules applied. Total rules applied 4596 place count 175 transition count 462
Drop transitions removed 28 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 53 with 80 rules applied. Total rules applied 4676 place count 175 transition count 382
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 54 with 141 rules applied. Total rules applied 4817 place count 81 transition count 335
Drop transitions removed 56 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 150 transitions.
Graph (trivial) has 14 edges and 81 vertex of which 14 / 81 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Iterating post reduction 54 with 151 rules applied. Total rules applied 4968 place count 74 transition count 185
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 55 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 78 transitions.
Graph (complete) has 148 edges and 70 vertex of which 46 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Iterating post reduction 55 with 83 rules applied. Total rules applied 5051 place count 46 transition count 95
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 56 with 12 rules applied. Total rules applied 5063 place count 46 transition count 83
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 57 with 33 rules applied. Total rules applied 5096 place count 24 transition count 72
Drop transitions removed 11 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 57 with 33 rules applied. Total rules applied 5129 place count 24 transition count 39
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 58 with 6 rules applied. Total rules applied 5135 place count 24 transition count 33
Applied a total of 5135 rules in 3618 ms. Remains 24 /2182 variables (removed 2158) and now considering 33/3989 (removed 3956) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3618 ms. Remains : 24/2182 places, 33/3989 transitions.
Finished random walk after 49 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DLCround-PT-09b-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 365 stabilizing places and 365 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(X(F(p1))))))'
Support contains 4 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2175 transition count 3982
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2175 transition count 3982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 2175 transition count 3981
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 2171 transition count 3977
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 2171 transition count 3977
Applied a total of 23 rules in 430 ms. Remains 2171 /2182 variables (removed 11) and now considering 3977/3989 (removed 12) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2024-05-22 16:48:37] [INFO ] Computed 184 invariants in 27 ms
[2024-05-22 16:48:38] [INFO ] Implicit Places using invariants in 1221 ms returned []
[2024-05-22 16:48:38] [INFO ] Invariant cache hit.
[2024-05-22 16:48:40] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2981 ms to find 0 implicit places.
[2024-05-22 16:48:40] [INFO ] Invariant cache hit.
[2024-05-22 16:48:45] [INFO ] Dead Transitions using invariants and state equation in 4525 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2182 places, 3977/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7940 ms. Remains : 2171/2182 places, 3977/3989 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s421 1) (EQ s1640 1)), p1:(AND (EQ s638 1) (EQ s1401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 1026 ms.
Product exploration explored 100000 steps with 2 reset in 1005 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1716 steps, including 0 resets, run visited all 2 properties in 51 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-22 16:48:48] [INFO ] Invariant cache hit.
[2024-05-22 16:48:52] [INFO ] [Real]Absence check using 184 positive place invariants in 569 ms returned sat
[2024-05-22 16:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 16:49:03] [INFO ] [Real]Absence check using state equation in 11297 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 124 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2024-05-22 16:49:03] [INFO ] Invariant cache hit.
[2024-05-22 16:49:04] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2024-05-22 16:49:04] [INFO ] Invariant cache hit.
[2024-05-22 16:49:06] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2842 ms to find 0 implicit places.
[2024-05-22 16:49:06] [INFO ] Invariant cache hit.
[2024-05-22 16:49:11] [INFO ] Dead Transitions using invariants and state equation in 4974 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7942 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1923 steps, including 0 resets, run visited all 2 properties in 41 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-22 16:49:12] [INFO ] Invariant cache hit.
[2024-05-22 16:49:16] [INFO ] [Real]Absence check using 184 positive place invariants in 538 ms returned sat
[2024-05-22 16:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 16:49:27] [INFO ] [Real]Absence check using state equation in 10660 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3 reset in 768 ms.
Product exploration explored 100000 steps with 1 reset in 969 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1906 edges and 2171 vertex of which 516 / 2171 are part of one of the 45 SCC in 1 ms
Free SCC test removed 471 places
Ensure Unique test removed 506 transitions
Reduce isomorphic transitions removed 506 transitions.
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 336 rules applied. Total rules applied 337 place count 1700 transition count 3471
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 28 rules applied. Total rules applied 365 place count 1700 transition count 3457
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 365 place count 1700 transition count 3462
Deduced a syphon composed of 360 places in 19 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 375 place count 1700 transition count 3462
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 527 place count 1548 transition count 2818
Deduced a syphon composed of 272 places in 16 ms
Iterating global reduction 2 with 152 rules applied. Total rules applied 679 place count 1548 transition count 2818
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 683 place count 1548 transition count 2814
Performed 587 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 859 places in 1 ms
Iterating global reduction 3 with 587 rules applied. Total rules applied 1270 place count 1548 transition count 2824
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1281 place count 1548 transition count 2813
Renaming transitions due to excessive name length > 1024 char.
Discarding 426 places :
Symmetric choice reduction at 4 with 426 rule applications. Total rules 1707 place count 1122 transition count 2123
Deduced a syphon composed of 456 places in 1 ms
Iterating global reduction 4 with 426 rules applied. Total rules applied 2133 place count 1122 transition count 2123
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 2155 place count 1122 transition count 2101
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2165 place count 1112 transition count 2091
Deduced a syphon composed of 446 places in 0 ms
Iterating global reduction 5 with 10 rules applied. Total rules applied 2175 place count 1112 transition count 2091
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 447 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 2176 place count 1112 transition count 2091
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2177 place count 1111 transition count 2090
Deduced a syphon composed of 446 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 2178 place count 1111 transition count 2090
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -210
Deduced a syphon composed of 478 places in 1 ms
Iterating global reduction 5 with 32 rules applied. Total rules applied 2210 place count 1111 transition count 2300
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 2227 place count 1111 transition count 2283
Discarding 46 places :
Symmetric choice reduction at 6 with 46 rule applications. Total rules 2273 place count 1065 transition count 2109
Deduced a syphon composed of 436 places in 0 ms
Iterating global reduction 6 with 46 rules applied. Total rules applied 2319 place count 1065 transition count 2109
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2327 place count 1065 transition count 2101
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2335 place count 1057 transition count 2085
Deduced a syphon composed of 428 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2343 place count 1057 transition count 2085
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 432 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2347 place count 1057 transition count 2125
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2351 place count 1053 transition count 2117
Deduced a syphon composed of 428 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2355 place count 1053 transition count 2117
Deduced a syphon composed of 428 places in 0 ms
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 7 with 40 rules applied. Total rules applied 2395 place count 1053 transition count 2077
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2412 place count 1036 transition count 2043
Deduced a syphon composed of 428 places in 0 ms
Iterating global reduction 7 with 17 rules applied. Total rules applied 2429 place count 1036 transition count 2043
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2446 place count 1019 transition count 1816
Deduced a syphon composed of 428 places in 0 ms
Iterating global reduction 7 with 17 rules applied. Total rules applied 2463 place count 1019 transition count 1816
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 2488 place count 1019 transition count 1791
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2504 place count 1003 transition count 1767
Deduced a syphon composed of 412 places in 0 ms
Iterating global reduction 8 with 16 rules applied. Total rules applied 2520 place count 1003 transition count 1767
Deduced a syphon composed of 412 places in 0 ms
Applied a total of 2520 rules in 2464 ms. Remains 1003 /2171 variables (removed 1168) and now considering 1767/3977 (removed 2210) transitions.
[2024-05-22 16:49:32] [INFO ] Redundant transitions in 201 ms returned []
[2024-05-22 16:49:32] [INFO ] Flow matrix only has 1736 transitions (discarded 31 similar events)
// Phase 1: matrix 1736 rows 1003 cols
[2024-05-22 16:49:32] [INFO ] Computed 184 invariants in 75 ms
[2024-05-22 16:49:33] [INFO ] Dead Transitions using invariants and state equation in 1331 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2171 places, 1767/3977 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4012 ms. Remains : 1003/2171 places, 1767/3977 transitions.
Built C files in :
/tmp/ltsmin17648115612413640756
[2024-05-22 16:49:33] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17648115612413640756
Running compilation step : cd /tmp/ltsmin17648115612413640756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17648115612413640756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17648115612413640756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 120 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2024-05-22 16:49:36] [INFO ] Computed 184 invariants in 15 ms
[2024-05-22 16:49:37] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2024-05-22 16:49:37] [INFO ] Invariant cache hit.
[2024-05-22 16:49:39] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2740 ms to find 0 implicit places.
[2024-05-22 16:49:39] [INFO ] Invariant cache hit.
[2024-05-22 16:49:43] [INFO ] Dead Transitions using invariants and state equation in 4271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7135 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Built C files in :
/tmp/ltsmin12714910442961900778
[2024-05-22 16:49:44] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12714910442961900778
Running compilation step : cd /tmp/ltsmin12714910442961900778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12714910442961900778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12714910442961900778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 16:49:47] [INFO ] Flatten gal took : 131 ms
[2024-05-22 16:49:47] [INFO ] Flatten gal took : 127 ms
[2024-05-22 16:49:47] [INFO ] Time to serialize gal into /tmp/LTL10324247539546978479.gal : 38 ms
[2024-05-22 16:49:47] [INFO ] Time to serialize properties into /tmp/LTL30351618982746967.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10324247539546978479.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9444612184119861518.hoa' '-atoms' '/tmp/LTL30351618982746967.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL30351618982746967.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9444612184119861518.hoa
Detected timeout of ITS tools.
[2024-05-22 16:50:02] [INFO ] Flatten gal took : 119 ms
[2024-05-22 16:50:03] [INFO ] Flatten gal took : 125 ms
[2024-05-22 16:50:03] [INFO ] Time to serialize gal into /tmp/LTL1537828310136973602.gal : 27 ms
[2024-05-22 16:50:03] [INFO ] Time to serialize properties into /tmp/LTL3362667951406165800.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1537828310136973602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3362667951406165800.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("((p758==1)&&(p2608==1))"))||(X(X(F("((p1093==1)&&(p2211==1))")))))))
Formula 0 simplified : G(F!"((p758==1)&&(p2608==1))" & XXG!"((p1093==1)&&(p2211==1))")
Detected timeout of ITS tools.
[2024-05-22 16:50:18] [INFO ] Flatten gal took : 107 ms
[2024-05-22 16:50:18] [INFO ] Applying decomposition
[2024-05-22 16:50:18] [INFO ] Flatten gal took : 117 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18399266001798176301.txt' '-o' '/tmp/graph18399266001798176301.bin' '-w' '/tmp/graph18399266001798176301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18399266001798176301.bin' '-l' '-1' '-v' '-w' '/tmp/graph18399266001798176301.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:50:18] [INFO ] Decomposing Gal with order
[2024-05-22 16:50:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:50:19] [INFO ] Removed a total of 3809 redundant transitions.
[2024-05-22 16:50:19] [INFO ] Flatten gal took : 390 ms
[2024-05-22 16:50:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 78 ms.
[2024-05-22 16:50:20] [INFO ] Time to serialize gal into /tmp/LTL12990297668529110510.gal : 43 ms
[2024-05-22 16:50:20] [INFO ] Time to serialize properties into /tmp/LTL7864912404255751057.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12990297668529110510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7864912404255751057.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i8.i0.i0.u174.p758==1)&&(i4.i0.i14.u632.p2608==1))"))||(X(X(F("((i13.u263.p1093==1)&&(i13.u560.p2211==1))")))))))
Formula 0 simplified : G(F!"((i8.i0.i0.u174.p758==1)&&(i4.i0.i14.u632.p2608==1))" & XXG!"((i13.u263.p1093==1)&&(i13.u560.p2211==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10226113906098117119
[2024-05-22 16:50:35] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10226113906098117119
Running compilation step : cd /tmp/ltsmin10226113906098117119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10226113906098117119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10226113906098117119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DLCround-PT-09b-LTLFireability-00 finished in 120997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 1 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2176 transition count 3983
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2176 transition count 3983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 2176 transition count 3982
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 2173 transition count 3979
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 2173 transition count 3979
Applied a total of 19 rules in 397 ms. Remains 2173 /2182 variables (removed 9) and now considering 3979/3989 (removed 10) transitions.
// Phase 1: matrix 3979 rows 2173 cols
[2024-05-22 16:50:38] [INFO ] Computed 184 invariants in 18 ms
[2024-05-22 16:50:40] [INFO ] Implicit Places using invariants in 1427 ms returned []
[2024-05-22 16:50:40] [INFO ] Invariant cache hit.
[2024-05-22 16:50:41] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned []
Implicit Place search using SMT with State Equation took 3257 ms to find 0 implicit places.
[2024-05-22 16:50:41] [INFO ] Invariant cache hit.
[2024-05-22 16:50:45] [INFO ] Dead Transitions using invariants and state equation in 3246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2173/2182 places, 3979/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6903 ms. Remains : 2173/2182 places, 3979/3989 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s1824 1), p0:(EQ s1824 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4814 steps with 0 reset in 36 ms.
FORMULA DLCround-PT-09b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-01 finished in 7151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Graph (trivial) has 1924 edges and 2182 vertex of which 530 / 2182 are part of one of the 44 SCC in 2 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 1695 transition count 3127
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 380 rules applied. Total rules applied 718 place count 1358 transition count 3084
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 746 place count 1330 transition count 3084
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 746 place count 1330 transition count 2905
Deduced a syphon composed of 179 places in 17 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1104 place count 1151 transition count 2905
Discarding 72 places :
Symmetric choice reduction at 3 with 72 rule applications. Total rules 1176 place count 1079 transition count 2329
Iterating global reduction 3 with 72 rules applied. Total rules applied 1248 place count 1079 transition count 2329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1252 place count 1079 transition count 2325
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1252 place count 1079 transition count 2321
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1260 place count 1075 transition count 2321
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 1 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2084 place count 663 transition count 1899
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2094 place count 663 transition count 1889
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2118 place count 639 transition count 1589
Iterating global reduction 5 with 24 rules applied. Total rules applied 2142 place count 639 transition count 1589
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2166 place count 639 transition count 1565
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2190 place count 627 transition count 1673
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2194 place count 627 transition count 1669
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2198 place count 623 transition count 1583
Iterating global reduction 7 with 4 rules applied. Total rules applied 2202 place count 623 transition count 1583
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2206 place count 623 transition count 1579
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2214 place count 619 transition count 1612
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 8 with 38 rules applied. Total rules applied 2252 place count 619 transition count 1574
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2271 place count 600 transition count 1536
Iterating global reduction 8 with 19 rules applied. Total rules applied 2290 place count 600 transition count 1536
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2309 place count 581 transition count 1288
Iterating global reduction 8 with 19 rules applied. Total rules applied 2328 place count 581 transition count 1288
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2347 place count 581 transition count 1269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2348 place count 580 transition count 1268
Applied a total of 2348 rules in 669 ms. Remains 580 /2182 variables (removed 1602) and now considering 1268/3989 (removed 2721) transitions.
[2024-05-22 16:50:46] [INFO ] Flow matrix only has 1239 transitions (discarded 29 similar events)
// Phase 1: matrix 1239 rows 580 cols
[2024-05-22 16:50:46] [INFO ] Computed 184 invariants in 4 ms
[2024-05-22 16:50:46] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-22 16:50:46] [INFO ] Flow matrix only has 1239 transitions (discarded 29 similar events)
[2024-05-22 16:50:46] [INFO ] Invariant cache hit.
[2024-05-22 16:50:47] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-22 16:50:47] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
[2024-05-22 16:50:47] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-22 16:50:47] [INFO ] Flow matrix only has 1239 transitions (discarded 29 similar events)
[2024-05-22 16:50:47] [INFO ] Invariant cache hit.
[2024-05-22 16:50:48] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/2182 places, 1268/3989 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3327 ms. Remains : 580/2182 places, 1268/3989 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s324 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-02 finished in 3384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (p1&&F(p2))))'
Support contains 3 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2176 transition count 3983
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2176 transition count 3983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 2176 transition count 3982
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 2173 transition count 3979
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 2173 transition count 3979
Applied a total of 19 rules in 418 ms. Remains 2173 /2182 variables (removed 9) and now considering 3979/3989 (removed 10) transitions.
// Phase 1: matrix 3979 rows 2173 cols
[2024-05-22 16:50:49] [INFO ] Computed 184 invariants in 14 ms
[2024-05-22 16:50:50] [INFO ] Implicit Places using invariants in 1115 ms returned []
[2024-05-22 16:50:50] [INFO ] Invariant cache hit.
[2024-05-22 16:50:52] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2922 ms to find 0 implicit places.
[2024-05-22 16:50:52] [INFO ] Invariant cache hit.
[2024-05-22 16:50:55] [INFO ] Dead Transitions using invariants and state equation in 3395 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2173/2182 places, 3979/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6743 ms. Remains : 2173/2182 places, 3979/3989 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), true]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s166 1), p2:(EQ s2097 1), p0:(EQ s1420 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-03 finished in 6927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Graph (trivial) has 1921 edges and 2182 vertex of which 530 / 2182 are part of one of the 44 SCC in 2 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 336 place count 1695 transition count 3129
Reduce places removed 335 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 375 rules applied. Total rules applied 711 place count 1360 transition count 3089
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 27 rules applied. Total rules applied 738 place count 1334 transition count 3088
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 741 place count 1333 transition count 3086
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 742 place count 1332 transition count 3086
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 179 Pre rules applied. Total rules applied 742 place count 1332 transition count 2907
Deduced a syphon composed of 179 places in 16 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 5 with 358 rules applied. Total rules applied 1100 place count 1153 transition count 2907
Discarding 73 places :
Symmetric choice reduction at 5 with 73 rule applications. Total rules 1173 place count 1080 transition count 2318
Iterating global reduction 5 with 73 rules applied. Total rules applied 1246 place count 1080 transition count 2318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1250 place count 1080 transition count 2314
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 1250 place count 1080 transition count 2310
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1258 place count 1076 transition count 2310
Performed 411 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 411 places in 0 ms
Reduce places removed 411 places and 0 transitions.
Iterating global reduction 6 with 822 rules applied. Total rules applied 2080 place count 665 transition count 1889
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2089 place count 665 transition count 1880
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 2113 place count 641 transition count 1580
Iterating global reduction 7 with 24 rules applied. Total rules applied 2137 place count 641 transition count 1580
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 2161 place count 641 transition count 1556
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 2185 place count 629 transition count 1670
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2188 place count 629 transition count 1667
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2191 place count 626 transition count 1603
Iterating global reduction 9 with 3 rules applied. Total rules applied 2194 place count 626 transition count 1603
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2197 place count 626 transition count 1600
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2203 place count 623 transition count 1625
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 10 with 37 rules applied. Total rules applied 2240 place count 623 transition count 1588
Discarding 18 places :
Symmetric choice reduction at 10 with 18 rule applications. Total rules 2258 place count 605 transition count 1552
Iterating global reduction 10 with 18 rules applied. Total rules applied 2276 place count 605 transition count 1552
Discarding 18 places :
Symmetric choice reduction at 10 with 18 rule applications. Total rules 2294 place count 587 transition count 1316
Iterating global reduction 10 with 18 rules applied. Total rules applied 2312 place count 587 transition count 1316
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 2330 place count 587 transition count 1298
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2331 place count 587 transition count 1298
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2332 place count 587 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2333 place count 586 transition count 1295
Iterating global reduction 11 with 1 rules applied. Total rules applied 2334 place count 586 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2335 place count 585 transition count 1282
Iterating global reduction 11 with 1 rules applied. Total rules applied 2336 place count 585 transition count 1282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2337 place count 585 transition count 1281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2338 place count 584 transition count 1280
Applied a total of 2338 rules in 724 ms. Remains 584 /2182 variables (removed 1598) and now considering 1280/3989 (removed 2709) transitions.
[2024-05-22 16:50:56] [INFO ] Flow matrix only has 1251 transitions (discarded 29 similar events)
// Phase 1: matrix 1251 rows 584 cols
[2024-05-22 16:50:56] [INFO ] Computed 184 invariants in 12 ms
[2024-05-22 16:50:56] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-22 16:50:56] [INFO ] Flow matrix only has 1251 transitions (discarded 29 similar events)
[2024-05-22 16:50:56] [INFO ] Invariant cache hit.
[2024-05-22 16:50:57] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-22 16:50:57] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1537 ms to find 0 implicit places.
[2024-05-22 16:50:57] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-22 16:50:57] [INFO ] Flow matrix only has 1251 transitions (discarded 29 similar events)
[2024-05-22 16:50:57] [INFO ] Invariant cache hit.
[2024-05-22 16:50:58] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/2182 places, 1280/3989 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3093 ms. Remains : 584/2182 places, 1280/3989 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-04 finished in 3181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(G(p1))) U X(G(p2))))'
Support contains 3 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2177 transition count 3984
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2177 transition count 3984
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 2177 transition count 3983
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 2175 transition count 3981
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 2175 transition count 3981
Applied a total of 15 rules in 405 ms. Remains 2175 /2182 variables (removed 7) and now considering 3981/3989 (removed 8) transitions.
// Phase 1: matrix 3981 rows 2175 cols
[2024-05-22 16:50:59] [INFO ] Computed 184 invariants in 12 ms
[2024-05-22 16:51:00] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2024-05-22 16:51:00] [INFO ] Invariant cache hit.
[2024-05-22 16:51:02] [INFO ] Implicit Places using invariants and state equation in 1782 ms returned []
Implicit Place search using SMT with State Equation took 2903 ms to find 0 implicit places.
[2024-05-22 16:51:02] [INFO ] Invariant cache hit.
[2024-05-22 16:51:06] [INFO ] Dead Transitions using invariants and state equation in 4308 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2175/2182 places, 3981/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7618 ms. Remains : 2175/2182 places, 3981/3989 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND p2 (NOT p0)), (NOT p1)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(EQ s1110 1), p0:(EQ s2159 1), p1:(EQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-05 finished in 7911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Graph (trivial) has 1924 edges and 2182 vertex of which 530 / 2182 are part of one of the 44 SCC in 1 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 1695 transition count 3127
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 380 rules applied. Total rules applied 718 place count 1358 transition count 3084
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 746 place count 1330 transition count 3084
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 746 place count 1330 transition count 2905
Deduced a syphon composed of 179 places in 16 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1104 place count 1151 transition count 2905
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1177 place count 1078 transition count 2316
Iterating global reduction 3 with 73 rules applied. Total rules applied 1250 place count 1078 transition count 2316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1254 place count 1078 transition count 2312
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1254 place count 1078 transition count 2308
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1262 place count 1074 transition count 2308
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2086 place count 662 transition count 1886
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2096 place count 662 transition count 1876
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2119 place count 639 transition count 1589
Iterating global reduction 5 with 23 rules applied. Total rules applied 2142 place count 639 transition count 1589
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2165 place count 639 transition count 1566
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2189 place count 627 transition count 1673
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2193 place count 627 transition count 1669
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2197 place count 623 transition count 1585
Iterating global reduction 7 with 4 rules applied. Total rules applied 2201 place count 623 transition count 1585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2205 place count 623 transition count 1581
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2213 place count 619 transition count 1615
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 8 with 40 rules applied. Total rules applied 2253 place count 619 transition count 1575
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 2273 place count 599 transition count 1535
Iterating global reduction 8 with 20 rules applied. Total rules applied 2293 place count 599 transition count 1535
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 2313 place count 579 transition count 1271
Iterating global reduction 8 with 20 rules applied. Total rules applied 2333 place count 579 transition count 1271
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 2353 place count 579 transition count 1251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2354 place count 578 transition count 1250
Applied a total of 2354 rules in 502 ms. Remains 578 /2182 variables (removed 1604) and now considering 1250/3989 (removed 2739) transitions.
[2024-05-22 16:51:07] [INFO ] Flow matrix only has 1222 transitions (discarded 28 similar events)
// Phase 1: matrix 1222 rows 578 cols
[2024-05-22 16:51:07] [INFO ] Computed 184 invariants in 4 ms
[2024-05-22 16:51:07] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-22 16:51:07] [INFO ] Flow matrix only has 1222 transitions (discarded 28 similar events)
[2024-05-22 16:51:07] [INFO ] Invariant cache hit.
[2024-05-22 16:51:08] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-22 16:51:08] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1648 ms to find 0 implicit places.
[2024-05-22 16:51:08] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-22 16:51:08] [INFO ] Flow matrix only has 1222 transitions (discarded 28 similar events)
[2024-05-22 16:51:08] [INFO ] Invariant cache hit.
[2024-05-22 16:51:09] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 578/2182 places, 1250/3989 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3048 ms. Remains : 578/2182 places, 1250/3989 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s57 1) (NEQ s354 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2679 steps with 0 reset in 48 ms.
FORMULA DLCround-PT-09b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-07 finished in 3191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)&&p0))||!(p2 U (!F(p2)||p3))))'
Support contains 3 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2175 transition count 3982
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2175 transition count 3982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 2175 transition count 3981
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 2171 transition count 3977
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 2171 transition count 3977
Applied a total of 23 rules in 404 ms. Remains 2171 /2182 variables (removed 11) and now considering 3977/3989 (removed 12) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2024-05-22 16:51:10] [INFO ] Computed 184 invariants in 16 ms
[2024-05-22 16:51:11] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2024-05-22 16:51:11] [INFO ] Invariant cache hit.
[2024-05-22 16:51:13] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2979 ms to find 0 implicit places.
[2024-05-22 16:51:13] [INFO ] Invariant cache hit.
[2024-05-22 16:51:17] [INFO ] Dead Transitions using invariants and state equation in 4416 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2182 places, 3977/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7801 ms. Remains : 2171/2182 places, 3977/3989 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3) (AND (NOT p1) p3)), (NOT p2), (OR (NOT p2) p3)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p3), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) p3) (AND p3 (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p3 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p3) p1), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={} source=4 dest: 5}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p1))), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=p3, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s631 1) (EQ s1941 1)), p3:(AND (EQ s631 1) (EQ s1941 1)), p2:(EQ s495 1), p1:(EQ s495 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 713 ms.
Product exploration explored 100000 steps with 30 reset in 925 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) p1), (X (NOT p3)), (X (NOT (OR (AND (NOT p0) p3) (AND p3 (NOT p1))))), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 p3 p1))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3) p1))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (OR (AND (NOT p0) p3) (AND p3 (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3))))), true, (X (X (NOT (AND p0 p3 p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p1))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 30 factoid took 188 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Finished random walk after 917 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=114 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) p1), (X (NOT p3)), (X (NOT (OR (AND (NOT p0) p3) (AND p3 (NOT p1))))), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 p3 p1))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3) p1))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (OR (AND (NOT p0) p3) (AND p3 (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3))))), true, (X (X (NOT (AND p0 p3 p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p1))))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 30 factoid took 290 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
[2024-05-22 16:51:20] [INFO ] Invariant cache hit.
[2024-05-22 16:51:24] [INFO ] [Real]Absence check using 184 positive place invariants in 451 ms returned sat
[2024-05-22 16:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 16:51:35] [INFO ] [Real]Absence check using state equation in 10798 ms returned unknown
Could not prove EG (NOT p2)
Support contains 1 out of 2171 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1909 edges and 2171 vertex of which 530 / 2171 are part of one of the 44 SCC in 1 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 331 place count 1684 transition count 3122
Reduce places removed 330 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 371 rules applied. Total rules applied 702 place count 1354 transition count 3081
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 28 rules applied. Total rules applied 730 place count 1327 transition count 3080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 731 place count 1326 transition count 3080
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 182 Pre rules applied. Total rules applied 731 place count 1326 transition count 2898
Deduced a syphon composed of 182 places in 17 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 4 with 364 rules applied. Total rules applied 1095 place count 1144 transition count 2898
Discarding 67 places :
Symmetric choice reduction at 4 with 67 rule applications. Total rules 1162 place count 1077 transition count 2327
Iterating global reduction 4 with 67 rules applied. Total rules applied 1229 place count 1077 transition count 2327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1233 place count 1077 transition count 2323
Performed 411 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 411 places in 1 ms
Reduce places removed 411 places and 0 transitions.
Iterating global reduction 5 with 822 rules applied. Total rules applied 2055 place count 666 transition count 1902
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 2064 place count 666 transition count 1893
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 2088 place count 642 transition count 1593
Iterating global reduction 6 with 24 rules applied. Total rules applied 2112 place count 642 transition count 1593
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 2136 place count 642 transition count 1569
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 2160 place count 630 transition count 1676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2164 place count 630 transition count 1672
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2168 place count 626 transition count 1588
Iterating global reduction 8 with 4 rules applied. Total rules applied 2172 place count 626 transition count 1588
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2176 place count 626 transition count 1584
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2184 place count 622 transition count 1618
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 9 with 37 rules applied. Total rules applied 2221 place count 622 transition count 1581
Discarding 17 places :
Symmetric choice reduction at 9 with 17 rule applications. Total rules 2238 place count 605 transition count 1547
Iterating global reduction 9 with 17 rules applied. Total rules applied 2255 place count 605 transition count 1547
Discarding 17 places :
Symmetric choice reduction at 9 with 17 rule applications. Total rules 2272 place count 588 transition count 1322
Iterating global reduction 9 with 17 rules applied. Total rules applied 2289 place count 588 transition count 1322
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 2306 place count 588 transition count 1305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2307 place count 587 transition count 1304
Applied a total of 2307 rules in 499 ms. Remains 587 /2171 variables (removed 1584) and now considering 1304/3977 (removed 2673) transitions.
[2024-05-22 16:51:36] [INFO ] Flow matrix only has 1273 transitions (discarded 31 similar events)
// Phase 1: matrix 1273 rows 587 cols
[2024-05-22 16:51:36] [INFO ] Computed 184 invariants in 3 ms
[2024-05-22 16:51:36] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-22 16:51:36] [INFO ] Flow matrix only has 1273 transitions (discarded 31 similar events)
[2024-05-22 16:51:36] [INFO ] Invariant cache hit.
[2024-05-22 16:51:37] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-22 16:51:37] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1680 ms to find 0 implicit places.
[2024-05-22 16:51:37] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-22 16:51:37] [INFO ] Flow matrix only has 1273 transitions (discarded 31 similar events)
[2024-05-22 16:51:37] [INFO ] Invariant cache hit.
[2024-05-22 16:51:39] [INFO ] Dead Transitions using invariants and state equation in 1239 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/2171 places, 1304/3977 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3465 ms. Remains : 587/2171 places, 1304/3977 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Finished random walk after 474 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
[2024-05-22 16:51:39] [INFO ] Flow matrix only has 1273 transitions (discarded 31 similar events)
[2024-05-22 16:51:39] [INFO ] Invariant cache hit.
[2024-05-22 16:51:40] [INFO ] [Real]Absence check using 184 positive place invariants in 87 ms returned sat
[2024-05-22 16:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 16:51:41] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2024-05-22 16:51:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:42] [INFO ] [Nat]Absence check using 184 positive place invariants in 102 ms returned sat
[2024-05-22 16:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 16:51:43] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2024-05-22 16:51:43] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-22 16:51:43] [INFO ] [Nat]Added 53 Read/Feed constraints in 16 ms returned sat
[2024-05-22 16:51:43] [INFO ] Computed and/alt/rep : 759/1386/759 causal constraints (skipped 453 transitions) in 110 ms.
[2024-05-22 16:51:43] [INFO ] Added : 3 causal constraints over 1 iterations in 292 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 39 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-08 finished in 34014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Graph (trivial) has 1924 edges and 2182 vertex of which 530 / 2182 are part of one of the 44 SCC in 1 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 337 place count 1695 transition count 3128
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 378 rules applied. Total rules applied 715 place count 1359 transition count 3086
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 743 place count 1331 transition count 3086
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 743 place count 1331 transition count 2907
Deduced a syphon composed of 179 places in 17 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1101 place count 1152 transition count 2907
Discarding 72 places :
Symmetric choice reduction at 3 with 72 rule applications. Total rules 1173 place count 1080 transition count 2319
Iterating global reduction 3 with 72 rules applied. Total rules applied 1245 place count 1080 transition count 2319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1249 place count 1080 transition count 2315
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1249 place count 1080 transition count 2311
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1257 place count 1076 transition count 2311
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2081 place count 664 transition count 1889
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2091 place count 664 transition count 1879
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2114 place count 641 transition count 1592
Iterating global reduction 5 with 23 rules applied. Total rules applied 2137 place count 641 transition count 1592
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2160 place count 641 transition count 1569
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2184 place count 629 transition count 1676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2188 place count 629 transition count 1672
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2192 place count 625 transition count 1588
Iterating global reduction 7 with 4 rules applied. Total rules applied 2196 place count 625 transition count 1588
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2200 place count 625 transition count 1584
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2208 place count 621 transition count 1618
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 8 with 40 rules applied. Total rules applied 2248 place count 621 transition count 1578
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 2268 place count 601 transition count 1538
Iterating global reduction 8 with 20 rules applied. Total rules applied 2288 place count 601 transition count 1538
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 2308 place count 581 transition count 1274
Iterating global reduction 8 with 20 rules applied. Total rules applied 2328 place count 581 transition count 1274
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 2348 place count 581 transition count 1254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2349 place count 580 transition count 1253
Applied a total of 2349 rules in 465 ms. Remains 580 /2182 variables (removed 1602) and now considering 1253/3989 (removed 2736) transitions.
[2024-05-22 16:51:44] [INFO ] Flow matrix only has 1225 transitions (discarded 28 similar events)
// Phase 1: matrix 1225 rows 580 cols
[2024-05-22 16:51:44] [INFO ] Computed 184 invariants in 3 ms
[2024-05-22 16:51:44] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-22 16:51:44] [INFO ] Flow matrix only has 1225 transitions (discarded 28 similar events)
[2024-05-22 16:51:44] [INFO ] Invariant cache hit.
[2024-05-22 16:51:45] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-22 16:51:46] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1817 ms to find 0 implicit places.
[2024-05-22 16:51:46] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-22 16:51:46] [INFO ] Flow matrix only has 1225 transitions (discarded 28 similar events)
[2024-05-22 16:51:46] [INFO ] Invariant cache hit.
[2024-05-22 16:51:47] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/2182 places, 1253/3989 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3383 ms. Remains : 580/2182 places, 1253/3989 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 229 steps with 0 reset in 6 ms.
FORMULA DLCround-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-09 finished in 3446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((G(p1)||(p2 U (p3||G(p2))))))&&p0)))'
Support contains 5 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2177 transition count 3984
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2177 transition count 3984
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 2177 transition count 3983
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 2173 transition count 3979
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 2173 transition count 3979
Applied a total of 19 rules in 394 ms. Remains 2173 /2182 variables (removed 9) and now considering 3979/3989 (removed 10) transitions.
// Phase 1: matrix 3979 rows 2173 cols
[2024-05-22 16:51:47] [INFO ] Computed 184 invariants in 12 ms
[2024-05-22 16:51:49] [INFO ] Implicit Places using invariants in 1192 ms returned []
[2024-05-22 16:51:49] [INFO ] Invariant cache hit.
[2024-05-22 16:51:50] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 3018 ms to find 0 implicit places.
[2024-05-22 16:51:50] [INFO ] Invariant cache hit.
[2024-05-22 16:51:54] [INFO ] Dead Transitions using invariants and state equation in 3467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2173/2182 places, 3979/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6886 ms. Remains : 2173/2182 places, 3979/3989 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s525 1) (EQ s1823 1)), p1:(EQ s1918 0), p3:(AND (NOT (AND (EQ s721 1) (EQ s2003 1))) (NEQ s525 1)), p2:(NEQ s525 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-09b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-11 finished in 7159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2175 transition count 3982
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2175 transition count 3982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 2175 transition count 3981
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 2171 transition count 3977
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 2171 transition count 3977
Applied a total of 23 rules in 521 ms. Remains 2171 /2182 variables (removed 11) and now considering 3977/3989 (removed 12) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2024-05-22 16:51:55] [INFO ] Computed 184 invariants in 11 ms
[2024-05-22 16:51:56] [INFO ] Implicit Places using invariants in 1189 ms returned []
[2024-05-22 16:51:56] [INFO ] Invariant cache hit.
[2024-05-22 16:51:57] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
[2024-05-22 16:51:57] [INFO ] Invariant cache hit.
[2024-05-22 16:52:00] [INFO ] Dead Transitions using invariants and state equation in 3070 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2182 places, 3977/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5912 ms. Remains : 2171/2182 places, 3977/3989 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s686 1) (EQ s1718 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3 reset in 743 ms.
Product exploration explored 100000 steps with 13 reset in 869 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 2444 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=128 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-22 16:52:02] [INFO ] Invariant cache hit.
[2024-05-22 16:52:06] [INFO ] [Real]Absence check using 184 positive place invariants in 309 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-09b-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-09b-LTLFireability-13 finished in 12527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((!(!p1 U X(p1))||p0))||X(X(p2))))))'
Support contains 6 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2175 transition count 3982
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2175 transition count 3982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 2175 transition count 3981
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 2171 transition count 3977
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 2171 transition count 3977
Applied a total of 23 rules in 406 ms. Remains 2171 /2182 variables (removed 11) and now considering 3977/3989 (removed 12) transitions.
[2024-05-22 16:52:07] [INFO ] Invariant cache hit.
[2024-05-22 16:52:08] [INFO ] Implicit Places using invariants in 957 ms returned []
[2024-05-22 16:52:08] [INFO ] Invariant cache hit.
[2024-05-22 16:52:10] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2613 ms to find 0 implicit places.
[2024-05-22 16:52:10] [INFO ] Invariant cache hit.
[2024-05-22 16:52:14] [INFO ] Dead Transitions using invariants and state equation in 4226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2182 places, 3977/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7248 ms. Remains : 2171/2182 places, 3977/3989 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s84 1) (EQ s1268 1)), p2:(OR (EQ s78 0) (EQ s1311 0)), p0:(OR (EQ s709 0) (EQ s1983 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 844 ms.
Product exploration explored 100000 steps with 0 reset in 1066 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 320 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-22 16:52:17] [INFO ] Invariant cache hit.
[2024-05-22 16:52:18] [INFO ] After 634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 16:52:19] [INFO ] [Nat]Absence check using 184 positive place invariants in 191 ms returned sat
[2024-05-22 16:52:22] [INFO ] After 2727ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-22 16:52:23] [INFO ] After 3936ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 675 ms.
[2024-05-22 16:52:23] [INFO ] After 5574ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 683 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=97 )
Parikh walk visited 3 properties in 34 ms.
Support contains 6 out of 2171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1908 edges and 2171 vertex of which 530 / 2171 are part of one of the 44 SCC in 1 ms
Free SCC test removed 486 places
Drop transitions removed 554 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 568 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 1685 transition count 3078
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 373 rules applied. Total rules applied 705 place count 1354 transition count 3036
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 733 place count 1326 transition count 3036
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 733 place count 1326 transition count 2854
Deduced a syphon composed of 182 places in 17 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1097 place count 1144 transition count 2854
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 1164 place count 1077 transition count 2283
Iterating global reduction 3 with 67 rules applied. Total rules applied 1231 place count 1077 transition count 2283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1235 place count 1077 transition count 2279
Performed 414 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 414 places in 0 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 4 with 828 rules applied. Total rules applied 2063 place count 663 transition count 1855
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2073 place count 663 transition count 1845
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2096 place count 640 transition count 1555
Iterating global reduction 5 with 23 rules applied. Total rules applied 2119 place count 640 transition count 1555
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2142 place count 640 transition count 1532
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -436
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 2224 place count 599 transition count 1968
Drop transitions removed 12 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 2239 place count 599 transition count 1953
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2261 place count 577 transition count 1395
Iterating global reduction 7 with 22 rules applied. Total rules applied 2283 place count 577 transition count 1395
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 2305 place count 577 transition count 1373
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
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 2311 place count 574 transition count 1398
Drop transitions removed 160 transitions
Redundant transition composition rules discarded 160 transitions
Iterating global reduction 8 with 160 rules applied. Total rules applied 2471 place count 574 transition count 1238
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 2481 place count 564 transition count 1107
Iterating global reduction 8 with 10 rules applied. Total rules applied 2491 place count 564 transition count 1107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 2501 place count 564 transition count 1097
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2509 place count 560 transition count 1125
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2514 place count 560 transition count 1120
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 2536 place count 560 transition count 1098
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2544 place count 556 transition count 1127
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2550 place count 556 transition count 1121
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 2571 place count 556 transition count 1100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2579 place count 552 transition count 1127
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2585 place count 552 transition count 1121
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 2606 place count 552 transition count 1100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2614 place count 548 transition count 1128
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 2621 place count 548 transition count 1121
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 2641 place count 548 transition count 1101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2649 place count 544 transition count 1128
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2655 place count 544 transition count 1122
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 2676 place count 544 transition count 1101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2684 place count 540 transition count 1129
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2689 place count 540 transition count 1124
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 15 with 22 rules applied. Total rules applied 2711 place count 540 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2719 place count 536 transition count 1129
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2725 place count 536 transition count 1123
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 2746 place count 536 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2754 place count 532 transition count 1131
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2760 place count 532 transition count 1125
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 2781 place count 532 transition count 1104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2789 place count 528 transition count 1131
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2795 place count 528 transition count 1125
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2816 place count 528 transition count 1104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2824 place count 524 transition count 1133
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2830 place count 524 transition count 1127
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2851 place count 524 transition count 1106
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2859 place count 520 transition count 1135
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2865 place count 520 transition count 1129
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2886 place count 520 transition count 1108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2894 place count 516 transition count 1141
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2900 place count 516 transition count 1135
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2921 place count 516 transition count 1114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2929 place count 512 transition count 1143
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2935 place count 512 transition count 1137
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2956 place count 512 transition count 1116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2964 place count 508 transition count 1145
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2970 place count 508 transition count 1139
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2991 place count 508 transition count 1118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2999 place count 504 transition count 1145
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 3005 place count 504 transition count 1139
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 3026 place count 504 transition count 1118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 3034 place count 500 transition count 1147
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 3040 place count 500 transition count 1141
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 25 with 21 rules applied. Total rules applied 3061 place count 500 transition count 1120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 3069 place count 496 transition count 1147
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 3075 place count 496 transition count 1141
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 26 with 21 rules applied. Total rules applied 3096 place count 496 transition count 1120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 3104 place count 492 transition count 1149
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 3110 place count 492 transition count 1143
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 27 with 21 rules applied. Total rules applied 3131 place count 492 transition count 1122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 3139 place count 488 transition count 1145
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 27 with 5 rules applied. Total rules applied 3144 place count 488 transition count 1140
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 28 with 20 rules applied. Total rules applied 3164 place count 488 transition count 1120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 3172 place count 484 transition count 1139
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 3176 place count 484 transition count 1135
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 3195 place count 484 transition count 1116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 3203 place count 480 transition count 1135
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 3207 place count 480 transition count 1131
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 3226 place count 480 transition count 1112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 3234 place count 476 transition count 1131
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 3238 place count 476 transition count 1127
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 3257 place count 476 transition count 1108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 3265 place count 472 transition count 1127
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 3269 place count 472 transition count 1123
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 3288 place count 472 transition count 1104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 3296 place count 468 transition count 1123
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 3300 place count 468 transition count 1119
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 3319 place count 468 transition count 1100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 3327 place count 464 transition count 1119
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 3331 place count 464 transition count 1115
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 3350 place count 464 transition count 1096
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 3358 place count 460 transition count 1115
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 3362 place count 460 transition count 1111
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 3381 place count 460 transition count 1092
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 3389 place count 456 transition count 1111
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 3393 place count 456 transition count 1107
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 36 with 19 rules applied. Total rules applied 3412 place count 456 transition count 1088
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 3420 place count 452 transition count 1107
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 3424 place count 452 transition count 1103
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 3443 place count 452 transition count 1084
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 37 with 8 rules applied. Total rules applied 3451 place count 448 transition count 1103
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 3455 place count 448 transition count 1099
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 38 with 19 rules applied. Total rules applied 3474 place count 448 transition count 1080
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 38 with 8 rules applied. Total rules applied 3482 place count 444 transition count 1099
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 3486 place count 444 transition count 1095
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 39 with 19 rules applied. Total rules applied 3505 place count 444 transition count 1076
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 39 with 8 rules applied. Total rules applied 3513 place count 440 transition count 1095
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3517 place count 440 transition count 1091
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 40 with 19 rules applied. Total rules applied 3536 place count 440 transition count 1072
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 40 with 8 rules applied. Total rules applied 3544 place count 436 transition count 1091
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 3548 place count 436 transition count 1087
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 41 with 19 rules applied. Total rules applied 3567 place count 436 transition count 1068
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 41 with 8 rules applied. Total rules applied 3575 place count 432 transition count 1095
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 3579 place count 432 transition count 1091
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 42 with 19 rules applied. Total rules applied 3598 place count 432 transition count 1072
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 42 with 8 rules applied. Total rules applied 3606 place count 428 transition count 1099
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 3610 place count 428 transition count 1095
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 43 with 19 rules applied. Total rules applied 3629 place count 428 transition count 1076
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 43 with 8 rules applied. Total rules applied 3637 place count 424 transition count 1095
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 43 with 4 rules applied. Total rules applied 3641 place count 424 transition count 1091
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 44 with 19 rules applied. Total rules applied 3660 place count 424 transition count 1072
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 44 with 8 rules applied. Total rules applied 3668 place count 420 transition count 1091
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 44 with 4 rules applied. Total rules applied 3672 place count 420 transition count 1087
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 45 with 19 rules applied. Total rules applied 3691 place count 420 transition count 1068
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 45 with 8 rules applied. Total rules applied 3699 place count 416 transition count 1087
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 45 with 4 rules applied. Total rules applied 3703 place count 416 transition count 1083
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 46 with 19 rules applied. Total rules applied 3722 place count 416 transition count 1064
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 46 with 8 rules applied. Total rules applied 3730 place count 412 transition count 1083
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 3734 place count 412 transition count 1079
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 47 with 19 rules applied. Total rules applied 3753 place count 412 transition count 1060
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 8 rules applied. Total rules applied 3761 place count 408 transition count 1079
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 47 with 4 rules applied. Total rules applied 3765 place count 408 transition count 1075
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 48 with 19 rules applied. Total rules applied 3784 place count 408 transition count 1056
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 48 with 8 rules applied. Total rules applied 3792 place count 404 transition count 1075
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 3796 place count 404 transition count 1071
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 49 with 19 rules applied. Total rules applied 3815 place count 404 transition count 1052
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 49 with 6 rules applied. Total rules applied 3821 place count 401 transition count 1062
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 3824 place count 401 transition count 1059
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 50 with 10 rules applied. Total rules applied 3834 place count 401 transition count 1049
Free-agglomeration rule applied 37 times with reduction of 2 identical transitions.
Iterating global reduction 50 with 37 rules applied. Total rules applied 3871 place count 401 transition count 1010
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 379 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 380 transitions.
Graph (complete) has 1078 edges and 364 vertex of which 202 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.0 ms
Discarding 162 places :
Also discarding 0 output transitions
Iterating post reduction 50 with 418 rules applied. Total rules applied 4289 place count 202 transition count 630
Drop transitions removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Iterating post reduction 51 with 162 rules applied. Total rules applied 4451 place count 202 transition count 468
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 52 with 61 rules applied. Total rules applied 4512 place count 202 transition count 407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 52 with 1 rules applied. Total rules applied 4513 place count 201 transition count 406
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 52 with 9 rules applied. Total rules applied 4522 place count 192 transition count 406
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 53 with 105 rules applied. Total rules applied 4627 place count 122 transition count 371
Drop transitions removed 27 transitions
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 115 transitions.
Graph (trivial) has 50 edges and 122 vertex of which 2 / 122 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 53 with 116 rules applied. Total rules applied 4743 place count 121 transition count 256
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 54 with 3 rules applied. Total rules applied 4746 place count 121 transition count 253
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 55 with 129 rules applied. Total rules applied 4875 place count 35 transition count 210
Drop transitions removed 86 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 139 transitions.
Graph (trivial) has 9 edges and 35 vertex of which 8 / 35 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 55 with 140 rules applied. Total rules applied 5015 place count 31 transition count 71
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 60 edges and 28 vertex of which 22 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 56 with 31 rules applied. Total rules applied 5046 place count 22 transition count 41
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 57 with 3 rules applied. Total rules applied 5049 place count 22 transition count 38
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 6 places and 0 transitions.
Iterating global reduction 58 with 9 rules applied. Total rules applied 5058 place count 16 transition count 35
Drop transitions removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 58 with 9 rules applied. Total rules applied 5067 place count 16 transition count 26
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 59 with 3 rules applied. Total rules applied 5070 place count 16 transition count 23
Graph (complete) has 34 edges and 16 vertex of which 14 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 59 with 1 rules applied. Total rules applied 5071 place count 14 transition count 23
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 60 with 3 rules applied. Total rules applied 5074 place count 14 transition count 20
Applied a total of 5074 rules in 2246 ms. Remains 14 /2171 variables (removed 2157) and now considering 20/3977 (removed 3957) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2246 ms. Remains : 14/2171 places, 20/3977 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND p2 p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND p1 p2 (NOT p0))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2 p0)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND (NOT p1) p2 p0)))]
Knowledge based reduction with 25 factoid took 1281 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 117 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 124 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2024-05-22 16:52:27] [INFO ] Invariant cache hit.
[2024-05-22 16:52:28] [INFO ] Implicit Places using invariants in 993 ms returned []
[2024-05-22 16:52:28] [INFO ] Invariant cache hit.
[2024-05-22 16:52:30] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned []
Implicit Place search using SMT with State Equation took 2929 ms to find 0 implicit places.
[2024-05-22 16:52:30] [INFO ] Invariant cache hit.
[2024-05-22 16:52:34] [INFO ] Dead Transitions using invariants and state equation in 3562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6618 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p2 p0)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 345 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-22 16:52:35] [INFO ] Invariant cache hit.
[2024-05-22 16:52:36] [INFO ] After 672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-22 16:52:37] [INFO ] [Nat]Absence check using 184 positive place invariants in 194 ms returned sat
[2024-05-22 16:52:40] [INFO ] After 2890ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2024-05-22 16:52:42] [INFO ] After 4538ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 927 ms.
[2024-05-22 16:52:42] [INFO ] After 6579ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 4 properties in 210 ms.
Support contains 6 out of 2171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1908 edges and 2171 vertex of which 530 / 2171 are part of one of the 44 SCC in 1 ms
Free SCC test removed 486 places
Drop transitions removed 554 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 568 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 1685 transition count 3078
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 373 rules applied. Total rules applied 705 place count 1354 transition count 3036
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 733 place count 1326 transition count 3036
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 733 place count 1326 transition count 2854
Deduced a syphon composed of 182 places in 20 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1097 place count 1144 transition count 2854
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 1164 place count 1077 transition count 2283
Iterating global reduction 3 with 67 rules applied. Total rules applied 1231 place count 1077 transition count 2283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1235 place count 1077 transition count 2279
Performed 414 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 414 places in 0 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 4 with 828 rules applied. Total rules applied 2063 place count 663 transition count 1855
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2073 place count 663 transition count 1845
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2096 place count 640 transition count 1555
Iterating global reduction 5 with 23 rules applied. Total rules applied 2119 place count 640 transition count 1555
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2142 place count 640 transition count 1532
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -436
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 2224 place count 599 transition count 1968
Drop transitions removed 12 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 2239 place count 599 transition count 1953
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2261 place count 577 transition count 1395
Iterating global reduction 7 with 22 rules applied. Total rules applied 2283 place count 577 transition count 1395
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 2305 place count 577 transition count 1373
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
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 2311 place count 574 transition count 1398
Drop transitions removed 160 transitions
Redundant transition composition rules discarded 160 transitions
Iterating global reduction 8 with 160 rules applied. Total rules applied 2471 place count 574 transition count 1238
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 2481 place count 564 transition count 1107
Iterating global reduction 8 with 10 rules applied. Total rules applied 2491 place count 564 transition count 1107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 2501 place count 564 transition count 1097
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2509 place count 560 transition count 1125
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2514 place count 560 transition count 1120
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 2536 place count 560 transition count 1098
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2544 place count 556 transition count 1127
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2550 place count 556 transition count 1121
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 2571 place count 556 transition count 1100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2579 place count 552 transition count 1127
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2585 place count 552 transition count 1121
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 2606 place count 552 transition count 1100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2614 place count 548 transition count 1128
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 2621 place count 548 transition count 1121
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 2641 place count 548 transition count 1101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2649 place count 544 transition count 1128
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2655 place count 544 transition count 1122
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 2676 place count 544 transition count 1101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2684 place count 540 transition count 1129
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2689 place count 540 transition count 1124
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 15 with 22 rules applied. Total rules applied 2711 place count 540 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2719 place count 536 transition count 1129
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2725 place count 536 transition count 1123
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 2746 place count 536 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2754 place count 532 transition count 1131
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2760 place count 532 transition count 1125
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 2781 place count 532 transition count 1104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2789 place count 528 transition count 1131
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2795 place count 528 transition count 1125
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2816 place count 528 transition count 1104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2824 place count 524 transition count 1133
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2830 place count 524 transition count 1127
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2851 place count 524 transition count 1106
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2859 place count 520 transition count 1135
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2865 place count 520 transition count 1129
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2886 place count 520 transition count 1108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2894 place count 516 transition count 1141
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2900 place count 516 transition count 1135
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2921 place count 516 transition count 1114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2929 place count 512 transition count 1143
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2935 place count 512 transition count 1137
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2956 place count 512 transition count 1116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2964 place count 508 transition count 1145
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2970 place count 508 transition count 1139
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2991 place count 508 transition count 1118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2999 place count 504 transition count 1145
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 3005 place count 504 transition count 1139
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 3026 place count 504 transition count 1118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 3034 place count 500 transition count 1147
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 3040 place count 500 transition count 1141
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 25 with 21 rules applied. Total rules applied 3061 place count 500 transition count 1120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 3069 place count 496 transition count 1147
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 3075 place count 496 transition count 1141
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 26 with 21 rules applied. Total rules applied 3096 place count 496 transition count 1120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 3104 place count 492 transition count 1149
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 3110 place count 492 transition count 1143
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 27 with 21 rules applied. Total rules applied 3131 place count 492 transition count 1122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 3139 place count 488 transition count 1145
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 27 with 5 rules applied. Total rules applied 3144 place count 488 transition count 1140
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 28 with 20 rules applied. Total rules applied 3164 place count 488 transition count 1120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 3172 place count 484 transition count 1139
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 3176 place count 484 transition count 1135
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 3195 place count 484 transition count 1116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 3203 place count 480 transition count 1135
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 3207 place count 480 transition count 1131
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 3226 place count 480 transition count 1112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 3234 place count 476 transition count 1131
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 3238 place count 476 transition count 1127
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 3257 place count 476 transition count 1108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 3265 place count 472 transition count 1127
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 3269 place count 472 transition count 1123
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 3288 place count 472 transition count 1104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 3296 place count 468 transition count 1123
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 3300 place count 468 transition count 1119
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 3319 place count 468 transition count 1100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 3327 place count 464 transition count 1119
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 3331 place count 464 transition count 1115
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 3350 place count 464 transition count 1096
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 3358 place count 460 transition count 1115
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 3362 place count 460 transition count 1111
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 3381 place count 460 transition count 1092
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 3389 place count 456 transition count 1111
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 3393 place count 456 transition count 1107
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 36 with 19 rules applied. Total rules applied 3412 place count 456 transition count 1088
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 3420 place count 452 transition count 1107
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 3424 place count 452 transition count 1103
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 3443 place count 452 transition count 1084
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 37 with 8 rules applied. Total rules applied 3451 place count 448 transition count 1103
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 3455 place count 448 transition count 1099
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 38 with 19 rules applied. Total rules applied 3474 place count 448 transition count 1080
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 38 with 8 rules applied. Total rules applied 3482 place count 444 transition count 1099
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 3486 place count 444 transition count 1095
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 39 with 19 rules applied. Total rules applied 3505 place count 444 transition count 1076
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 39 with 8 rules applied. Total rules applied 3513 place count 440 transition count 1095
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3517 place count 440 transition count 1091
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 40 with 19 rules applied. Total rules applied 3536 place count 440 transition count 1072
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 40 with 8 rules applied. Total rules applied 3544 place count 436 transition count 1091
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 3548 place count 436 transition count 1087
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 41 with 19 rules applied. Total rules applied 3567 place count 436 transition count 1068
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 41 with 8 rules applied. Total rules applied 3575 place count 432 transition count 1095
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 3579 place count 432 transition count 1091
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 42 with 19 rules applied. Total rules applied 3598 place count 432 transition count 1072
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 42 with 8 rules applied. Total rules applied 3606 place count 428 transition count 1099
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 3610 place count 428 transition count 1095
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 43 with 19 rules applied. Total rules applied 3629 place count 428 transition count 1076
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 43 with 8 rules applied. Total rules applied 3637 place count 424 transition count 1095
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 43 with 4 rules applied. Total rules applied 3641 place count 424 transition count 1091
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 44 with 19 rules applied. Total rules applied 3660 place count 424 transition count 1072
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 44 with 8 rules applied. Total rules applied 3668 place count 420 transition count 1091
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 44 with 4 rules applied. Total rules applied 3672 place count 420 transition count 1087
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 45 with 19 rules applied. Total rules applied 3691 place count 420 transition count 1068
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 45 with 8 rules applied. Total rules applied 3699 place count 416 transition count 1087
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 45 with 4 rules applied. Total rules applied 3703 place count 416 transition count 1083
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 46 with 19 rules applied. Total rules applied 3722 place count 416 transition count 1064
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 46 with 8 rules applied. Total rules applied 3730 place count 412 transition count 1083
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 3734 place count 412 transition count 1079
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 47 with 19 rules applied. Total rules applied 3753 place count 412 transition count 1060
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 8 rules applied. Total rules applied 3761 place count 408 transition count 1079
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 47 with 4 rules applied. Total rules applied 3765 place count 408 transition count 1075
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 48 with 19 rules applied. Total rules applied 3784 place count 408 transition count 1056
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 48 with 8 rules applied. Total rules applied 3792 place count 404 transition count 1075
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 3796 place count 404 transition count 1071
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 49 with 19 rules applied. Total rules applied 3815 place count 404 transition count 1052
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 49 with 6 rules applied. Total rules applied 3821 place count 401 transition count 1062
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 3824 place count 401 transition count 1059
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 50 with 10 rules applied. Total rules applied 3834 place count 401 transition count 1049
Free-agglomeration rule applied 37 times with reduction of 2 identical transitions.
Iterating global reduction 50 with 37 rules applied. Total rules applied 3871 place count 401 transition count 1010
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 379 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 380 transitions.
Graph (complete) has 1078 edges and 364 vertex of which 202 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.0 ms
Discarding 162 places :
Also discarding 0 output transitions
Iterating post reduction 50 with 418 rules applied. Total rules applied 4289 place count 202 transition count 630
Drop transitions removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Iterating post reduction 51 with 162 rules applied. Total rules applied 4451 place count 202 transition count 468
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 52 with 61 rules applied. Total rules applied 4512 place count 202 transition count 407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 52 with 1 rules applied. Total rules applied 4513 place count 201 transition count 406
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 52 with 9 rules applied. Total rules applied 4522 place count 192 transition count 406
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 53 with 105 rules applied. Total rules applied 4627 place count 122 transition count 371
Drop transitions removed 27 transitions
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 115 transitions.
Graph (trivial) has 50 edges and 122 vertex of which 2 / 122 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 53 with 116 rules applied. Total rules applied 4743 place count 121 transition count 256
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 54 with 3 rules applied. Total rules applied 4746 place count 121 transition count 253
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 55 with 129 rules applied. Total rules applied 4875 place count 35 transition count 210
Drop transitions removed 86 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 139 transitions.
Graph (trivial) has 9 edges and 35 vertex of which 8 / 35 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 55 with 140 rules applied. Total rules applied 5015 place count 31 transition count 71
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 60 edges and 28 vertex of which 22 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 56 with 31 rules applied. Total rules applied 5046 place count 22 transition count 41
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 57 with 3 rules applied. Total rules applied 5049 place count 22 transition count 38
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 6 places and 0 transitions.
Iterating global reduction 58 with 9 rules applied. Total rules applied 5058 place count 16 transition count 35
Drop transitions removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 58 with 9 rules applied. Total rules applied 5067 place count 16 transition count 26
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 59 with 3 rules applied. Total rules applied 5070 place count 16 transition count 23
Graph (complete) has 34 edges and 16 vertex of which 14 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 59 with 1 rules applied. Total rules applied 5071 place count 14 transition count 23
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 60 with 3 rules applied. Total rules applied 5074 place count 14 transition count 20
Applied a total of 5074 rules in 2327 ms. Remains 14 /2171 variables (removed 2157) and now considering 20/3977 (removed 3957) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2328 ms. Remains : 14/2171 places, 20/3977 transitions.
Finished random walk after 157 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=78 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p2 p0)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 p0))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND p2 p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2 p0)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND (NOT p1) p2 p0)))]
Knowledge based reduction with 26 factoid took 1473 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 819 ms.
Product exploration explored 100000 steps with 0 reset in 1065 ms.
Built C files in :
/tmp/ltsmin17461888220633739010
[2024-05-22 16:52:49] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17461888220633739010
Running compilation step : cd /tmp/ltsmin17461888220633739010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17461888220633739010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17461888220633739010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 127 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2024-05-22 16:52:52] [INFO ] Invariant cache hit.
[2024-05-22 16:52:53] [INFO ] Implicit Places using invariants in 1185 ms returned []
[2024-05-22 16:52:53] [INFO ] Invariant cache hit.
[2024-05-22 16:52:55] [INFO ] Implicit Places using invariants and state equation in 1750 ms returned []
Implicit Place search using SMT with State Equation took 2937 ms to find 0 implicit places.
[2024-05-22 16:52:55] [INFO ] Invariant cache hit.
[2024-05-22 16:53:00] [INFO ] Dead Transitions using invariants and state equation in 4559 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7624 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Built C files in :
/tmp/ltsmin16396600334705714216
[2024-05-22 16:53:00] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16396600334705714216
Running compilation step : cd /tmp/ltsmin16396600334705714216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16396600334705714216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16396600334705714216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 16:53:03] [INFO ] Flatten gal took : 129 ms
[2024-05-22 16:53:03] [INFO ] Flatten gal took : 114 ms
[2024-05-22 16:53:03] [INFO ] Time to serialize gal into /tmp/LTL8842810912581123899.gal : 19 ms
[2024-05-22 16:53:03] [INFO ] Time to serialize properties into /tmp/LTL9109228738151386411.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8842810912581123899.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4924286542876193085.hoa' '-atoms' '/tmp/LTL9109228738151386411.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9109228738151386411.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4924286542876193085.hoa
Detected timeout of ITS tools.
[2024-05-22 16:53:18] [INFO ] Flatten gal took : 95 ms
[2024-05-22 16:53:18] [INFO ] Flatten gal took : 104 ms
[2024-05-22 16:53:18] [INFO ] Time to serialize gal into /tmp/LTL12861551341326331217.gal : 21 ms
[2024-05-22 16:53:18] [INFO ] Time to serialize properties into /tmp/LTL11783600740556391112.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12861551341326331217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11783600740556391112.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((G(((!((!("((p167==1)&&(p1988==1))"))U(X("((p167==1)&&(p1988==1))"))))||("(p1202==0)"))||("(p3181==0)")))||(X(X("((p141==0)||(p...172
Formula 0 simplified : G(F(!"(p1202==0)" & !"(p3181==0)" & (!"((p167==1)&&(p1988==1))" U X"((p167==1)&&(p1988==1))")) & F!"((p141==0)||(p2061==0))")
Detected timeout of ITS tools.
[2024-05-22 16:53:34] [INFO ] Flatten gal took : 95 ms
[2024-05-22 16:53:34] [INFO ] Applying decomposition
[2024-05-22 16:53:34] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10946883158791691345.txt' '-o' '/tmp/graph10946883158791691345.bin' '-w' '/tmp/graph10946883158791691345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10946883158791691345.bin' '-l' '-1' '-v' '-w' '/tmp/graph10946883158791691345.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:53:34] [INFO ] Decomposing Gal with order
[2024-05-22 16:53:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:53:34] [INFO ] Removed a total of 3849 redundant transitions.
[2024-05-22 16:53:35] [INFO ] Flatten gal took : 217 ms
[2024-05-22 16:53:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 32 ms.
[2024-05-22 16:53:35] [INFO ] Time to serialize gal into /tmp/LTL7842573239429445411.gal : 29 ms
[2024-05-22 16:53:35] [INFO ] Time to serialize properties into /tmp/LTL6595840768089349147.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7842573239429445411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6595840768089349147.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((G(((!((!("((i2.u36.p167==1)&&(i8.u530.p1988==1))"))U(X("((i2.u36.p167==1)&&(i8.u530.p1988==1))"))))||("(i14.i1.i1.u303.p1202==...248
Formula 0 simplified : G(F(!"(i14.i1.i1.u303.p1202==0)" & !"(i14.i1.i14.u756.p3181==0)" & (!"((i2.u36.p167==1)&&(i8.u530.p1988==1))" U X"((i2.u36.p167==1)&...224
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5022545225224130172
[2024-05-22 16:53:50] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5022545225224130172
Running compilation step : cd /tmp/ltsmin5022545225224130172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5022545225224130172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5022545225224130172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DLCround-PT-09b-LTLFireability-14 finished in 106192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2175 transition count 3982
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2175 transition count 3982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 2175 transition count 3981
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 2171 transition count 3977
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 2171 transition count 3977
Applied a total of 23 rules in 432 ms. Remains 2171 /2182 variables (removed 11) and now considering 3977/3989 (removed 12) transitions.
[2024-05-22 16:53:53] [INFO ] Invariant cache hit.
[2024-05-22 16:53:54] [INFO ] Implicit Places using invariants in 1137 ms returned []
[2024-05-22 16:53:54] [INFO ] Invariant cache hit.
[2024-05-22 16:53:55] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 2249 ms to find 0 implicit places.
[2024-05-22 16:53:55] [INFO ] Invariant cache hit.
[2024-05-22 16:54:00] [INFO ] Dead Transitions using invariants and state equation in 4525 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2182 places, 3977/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7207 ms. Remains : 2171/2182 places, 3977/3989 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s691 1), p0:(OR (EQ s939 0) (EQ s2133 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10 reset in 727 ms.
Product exploration explored 100000 steps with 7 reset in 929 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 16:54:02] [INFO ] Invariant cache hit.
[2024-05-22 16:54:03] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:54:03] [INFO ] [Nat]Absence check using 184 positive place invariants in 189 ms returned sat
[2024-05-22 16:54:05] [INFO ] After 2074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 16:54:06] [INFO ] After 2319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-22 16:54:06] [INFO ] After 3014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 315 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=105 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1909 edges and 2171 vertex of which 524 / 2171 are part of one of the 43 SCC in 1 ms
Free SCC test removed 481 places
Ensure Unique test removed 519 transitions
Reduce isomorphic transitions removed 519 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 1689 transition count 3124
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 375 rules applied. Total rules applied 709 place count 1356 transition count 3082
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 737 place count 1328 transition count 3082
Performed 183 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 183 Pre rules applied. Total rules applied 737 place count 1328 transition count 2899
Deduced a syphon composed of 183 places in 16 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 1103 place count 1145 transition count 2899
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 1169 place count 1079 transition count 2341
Iterating global reduction 3 with 66 rules applied. Total rules applied 1235 place count 1079 transition count 2341
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1239 place count 1079 transition count 2337
Performed 413 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 413 places in 1 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 4 with 826 rules applied. Total rules applied 2065 place count 666 transition count 1914
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2075 place count 666 transition count 1904
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2100 place count 641 transition count 1591
Iterating global reduction 5 with 25 rules applied. Total rules applied 2125 place count 641 transition count 1591
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2149 place count 641 transition count 1567
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 2175 place count 628 transition count 1686
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2179 place count 628 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2183 place count 624 transition count 1598
Iterating global reduction 7 with 4 rules applied. Total rules applied 2187 place count 624 transition count 1598
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2191 place count 624 transition count 1594
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2199 place count 620 transition count 1628
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2238 place count 620 transition count 1589
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2256 place count 602 transition count 1553
Iterating global reduction 8 with 18 rules applied. Total rules applied 2274 place count 602 transition count 1553
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2292 place count 584 transition count 1315
Iterating global reduction 8 with 18 rules applied. Total rules applied 2310 place count 584 transition count 1315
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2328 place count 584 transition count 1297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2329 place count 583 transition count 1296
Applied a total of 2329 rules in 484 ms. Remains 583 /2171 variables (removed 1588) and now considering 1296/3977 (removed 2681) transitions.
[2024-05-22 16:54:07] [INFO ] Flow matrix only has 1267 transitions (discarded 29 similar events)
// Phase 1: matrix 1267 rows 583 cols
[2024-05-22 16:54:07] [INFO ] Computed 184 invariants in 3 ms
[2024-05-22 16:54:07] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-22 16:54:07] [INFO ] Flow matrix only has 1267 transitions (discarded 29 similar events)
[2024-05-22 16:54:07] [INFO ] Invariant cache hit.
[2024-05-22 16:54:08] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-22 16:54:09] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
[2024-05-22 16:54:09] [INFO ] Redundant transitions in 60 ms returned []
[2024-05-22 16:54:09] [INFO ] Flow matrix only has 1267 transitions (discarded 29 similar events)
[2024-05-22 16:54:09] [INFO ] Invariant cache hit.
[2024-05-22 16:54:10] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/2171 places, 1296/3977 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3532 ms. Remains : 583/2171 places, 1296/3977 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 126 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 4077 steps, including 1 resets, run visited all 5 properties in 90 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 292 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering criterion allowed to conclude after 4024 steps with 7 reset in 93 ms.
FORMULA DLCround-PT-09b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-15 finished in 18517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(X(F(p1))))))'
Found a Shortening insensitive property : DLCround-PT-09b-LTLFireability-00
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Graph (trivial) has 1918 edges and 2182 vertex of which 516 / 2182 are part of one of the 45 SCC in 1 ms
Free SCC test removed 471 places
Ensure Unique test removed 506 transitions
Reduce isomorphic transitions removed 506 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 341 place count 1710 transition count 3142
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 383 rules applied. Total rules applied 724 place count 1370 transition count 3099
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 30 rules applied. Total rules applied 754 place count 1342 transition count 3097
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 756 place count 1340 transition count 3097
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 180 Pre rules applied. Total rules applied 756 place count 1340 transition count 2917
Deduced a syphon composed of 180 places in 17 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 4 with 360 rules applied. Total rules applied 1116 place count 1160 transition count 2917
Discarding 69 places :
Symmetric choice reduction at 4 with 69 rule applications. Total rules 1185 place count 1091 transition count 2356
Iterating global reduction 4 with 69 rules applied. Total rules applied 1254 place count 1091 transition count 2356
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1258 place count 1091 transition count 2352
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 1258 place count 1091 transition count 2348
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1266 place count 1087 transition count 2348
Performed 418 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 418 places in 1 ms
Reduce places removed 418 places and 0 transitions.
Iterating global reduction 5 with 836 rules applied. Total rules applied 2102 place count 669 transition count 1920
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 2112 place count 669 transition count 1910
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 2135 place count 646 transition count 1623
Iterating global reduction 6 with 23 rules applied. Total rules applied 2158 place count 646 transition count 1623
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 2180 place count 646 transition count 1601
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 2182 place count 645 transition count 1600
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 2206 place count 633 transition count 1707
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2210 place count 633 transition count 1703
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2214 place count 629 transition count 1619
Iterating global reduction 8 with 4 rules applied. Total rules applied 2218 place count 629 transition count 1619
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2222 place count 629 transition count 1615
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2230 place count 625 transition count 1649
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2234 place count 625 transition count 1645
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2235 place count 624 transition count 1644
Applied a total of 2235 rules in 427 ms. Remains 624 /2182 variables (removed 1558) and now considering 1644/3989 (removed 2345) transitions.
[2024-05-22 16:54:12] [INFO ] Flow matrix only has 1593 transitions (discarded 51 similar events)
// Phase 1: matrix 1593 rows 624 cols
[2024-05-22 16:54:12] [INFO ] Computed 184 invariants in 3 ms
[2024-05-22 16:54:13] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-22 16:54:13] [INFO ] Flow matrix only has 1593 transitions (discarded 51 similar events)
[2024-05-22 16:54:13] [INFO ] Invariant cache hit.
[2024-05-22 16:54:13] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 16:54:14] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1817 ms to find 0 implicit places.
[2024-05-22 16:54:14] [INFO ] Flow matrix only has 1593 transitions (discarded 51 similar events)
[2024-05-22 16:54:14] [INFO ] Invariant cache hit.
[2024-05-22 16:54:15] [INFO ] Dead Transitions using invariants and state equation in 1669 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 624/2182 places, 1644/3989 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3919 ms. Remains : 624/2182 places, 1644/3989 transitions.
Running random walk in product with property : DLCround-PT-09b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s51 1) (EQ s358 1)), p1:(AND (EQ s77 1) (EQ s239 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property DLCround-PT-09b-LTLFireability-00 finished in 4147 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((!(!p1 U X(p1))||p0))||X(X(p2))))))'
Found a Lengthening insensitive property : DLCround-PT-09b-LTLFireability-14
Stuttering acceptance computed with spot in 126 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 2182 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2182/2182 places, 3989/3989 transitions.
Graph (trivial) has 1920 edges and 2182 vertex of which 530 / 2182 are part of one of the 44 SCC in 1 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 337 place count 1695 transition count 3128
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 379 rules applied. Total rules applied 716 place count 1359 transition count 3085
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 744 place count 1331 transition count 3085
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 744 place count 1331 transition count 2906
Deduced a syphon composed of 179 places in 16 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1102 place count 1152 transition count 2906
Discarding 72 places :
Symmetric choice reduction at 3 with 72 rule applications. Total rules 1174 place count 1080 transition count 2330
Iterating global reduction 3 with 72 rules applied. Total rules applied 1246 place count 1080 transition count 2330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1250 place count 1080 transition count 2326
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1250 place count 1080 transition count 2322
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1258 place count 1076 transition count 2322
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2082 place count 664 transition count 1900
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2092 place count 664 transition count 1890
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2115 place count 641 transition count 1600
Iterating global reduction 5 with 23 rules applied. Total rules applied 2138 place count 641 transition count 1600
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2161 place count 641 transition count 1577
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2185 place count 629 transition count 1691
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2188 place count 629 transition count 1688
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2191 place count 626 transition count 1624
Iterating global reduction 7 with 3 rules applied. Total rules applied 2194 place count 626 transition count 1624
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2197 place count 626 transition count 1621
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2203 place count 623 transition count 1646
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2207 place count 623 transition count 1642
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2208 place count 622 transition count 1641
Applied a total of 2208 rules in 369 ms. Remains 622 /2182 variables (removed 1560) and now considering 1641/3989 (removed 2348) transitions.
[2024-05-22 16:54:16] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
// Phase 1: matrix 1593 rows 622 cols
[2024-05-22 16:54:16] [INFO ] Computed 184 invariants in 3 ms
[2024-05-22 16:54:17] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-05-22 16:54:17] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2024-05-22 16:54:17] [INFO ] Invariant cache hit.
[2024-05-22 16:54:17] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 16:54:18] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1830 ms to find 0 implicit places.
[2024-05-22 16:54:18] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2024-05-22 16:54:18] [INFO ] Invariant cache hit.
[2024-05-22 16:54:19] [INFO ] Dead Transitions using invariants and state equation in 1524 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 622/2182 places, 1641/3989 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3725 ms. Remains : 622/2182 places, 1641/3989 transitions.
Running random walk in product with property : DLCround-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s170 1)), p2:(OR (EQ s7 0) (EQ s192 0)), p0:(OR (EQ s83 0) (EQ s528 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1753 ms.
Product exploration explored 100000 steps with 0 reset in 1869 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 324 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 16:54:24] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2024-05-22 16:54:24] [INFO ] Invariant cache hit.
[2024-05-22 16:54:24] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 16:54:24] [INFO ] [Nat]Absence check using 184 positive place invariants in 53 ms returned sat
[2024-05-22 16:54:25] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-22 16:54:25] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 16:54:25] [INFO ] After 59ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-22 16:54:25] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-22 16:54:25] [INFO ] After 1009ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 622 transition count 1594
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -322
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 105 place count 593 transition count 1916
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 108 place count 593 transition count 1913
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 574 transition count 1417
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 574 transition count 1417
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 165 place count 574 transition count 1398
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 3 with 145 rules applied. Total rules applied 310 place count 574 transition count 1253
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 320 place count 564 transition count 1122
Iterating global reduction 3 with 10 rules applied. Total rules applied 330 place count 564 transition count 1122
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 340 place count 564 transition count 1112
Free-agglomeration rule applied 363 times with reduction of 194 identical transitions.
Iterating global reduction 4 with 363 rules applied. Total rules applied 703 place count 564 transition count 555
Reduce places removed 372 places and 0 transitions.
Drop transitions removed 386 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 387 transitions.
Graph (complete) has 344 edges and 192 vertex of which 45 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.1 ms
Discarding 147 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Iterating post reduction 4 with 760 rules applied. Total rules applied 1463 place count 45 transition count 100
Drop transitions removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1480 place count 45 transition count 83
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1504 place count 21 transition count 38
Iterating global reduction 6 with 24 rules applied. Total rules applied 1528 place count 21 transition count 38
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 1530 place count 20 transition count 37
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1535 place count 20 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1536 place count 19 transition count 30
Iterating global reduction 7 with 1 rules applied. Total rules applied 1537 place count 19 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1538 place count 19 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1539 place count 18 transition count 28
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 5 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 9 rules applied. Total rules applied 1548 place count 12 transition count 24
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1555 place count 12 transition count 17
Applied a total of 1555 rules in 174 ms. Remains 12 /622 variables (removed 610) and now considering 17/1641 (removed 1624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 12/622 places, 17/1641 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p2 p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2 p0)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND (NOT p1) p2 p0)))]
Knowledge based reduction with 27 factoid took 1529 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Applied a total of 0 rules in 12 ms. Remains 622 /622 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2024-05-22 16:54:27] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2024-05-22 16:54:27] [INFO ] Invariant cache hit.
[2024-05-22 16:54:28] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-05-22 16:54:28] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2024-05-22 16:54:28] [INFO ] Invariant cache hit.
[2024-05-22 16:54:28] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 16:54:29] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
[2024-05-22 16:54:29] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2024-05-22 16:54:29] [INFO ] Invariant cache hit.
[2024-05-22 16:54:31] [INFO ] Dead Transitions using invariants and state equation in 1674 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3574 ms. Remains : 622/622 places, 1641/1641 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 p0)), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND p2 p0)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 506 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 16:54:32] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2024-05-22 16:54:32] [INFO ] Invariant cache hit.
[2024-05-22 16:54:32] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 16:54:32] [INFO ] [Nat]Absence check using 184 positive place invariants in 47 ms returned sat
[2024-05-22 16:54:33] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-22 16:54:33] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 16:54:33] [INFO ] After 56ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-22 16:54:33] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-22 16:54:33] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 622 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 621 transition count 1584
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 621 transition count 1584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 621 transition count 1583
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -322
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 108 place count 592 transition count 1905
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 111 place count 592 transition count 1902
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 130 place count 573 transition count 1406
Iterating global reduction 3 with 19 rules applied. Total rules applied 149 place count 573 transition count 1406
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 168 place count 573 transition count 1387
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 4 with 145 rules applied. Total rules applied 313 place count 573 transition count 1242
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 323 place count 563 transition count 1111
Iterating global reduction 4 with 10 rules applied. Total rules applied 333 place count 563 transition count 1111
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 343 place count 563 transition count 1101
Free-agglomeration rule applied 364 times with reduction of 195 identical transitions.
Iterating global reduction 5 with 364 rules applied. Total rules applied 707 place count 563 transition count 542
Reduce places removed 373 places and 0 transitions.
Drop transitions removed 387 transitions
Reduce isomorphic transitions removed 387 transitions.
Graph (complete) has 328 edges and 190 vertex of which 43 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.0 ms
Discarding 147 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Iterating post reduction 5 with 761 rules applied. Total rules applied 1468 place count 43 transition count 87
Drop transitions removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1485 place count 43 transition count 70
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 1510 place count 18 transition count 30
Iterating global reduction 7 with 25 rules applied. Total rules applied 1535 place count 18 transition count 30
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 1537 place count 17 transition count 29
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1542 place count 17 transition count 24
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1543 place count 16 transition count 22
Iterating global reduction 8 with 1 rules applied. Total rules applied 1544 place count 16 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1545 place count 15 transition count 21
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 5 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 8 rules applied. Total rules applied 1553 place count 9 transition count 18
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1559 place count 9 transition count 12
Applied a total of 1559 rules in 200 ms. Remains 9 /622 variables (removed 613) and now considering 12/1641 (removed 1629) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 9/622 places, 12/1641 transitions.
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 p0)), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND p2 p0)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p2 p0))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (AND p1 p2 (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 (NOT p0))), (F (NOT (AND p2 p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 p2 p0))]
Knowledge based reduction with 28 factoid took 1881 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1506 ms.
Product exploration explored 100000 steps with 0 reset in 1700 ms.
Built C files in :
/tmp/ltsmin16443646073685269982
[2024-05-22 16:54:39] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16443646073685269982
Running compilation step : cd /tmp/ltsmin16443646073685269982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16443646073685269982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16443646073685269982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Applied a total of 0 rules in 12 ms. Remains 622 /622 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2024-05-22 16:54:42] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2024-05-22 16:54:42] [INFO ] Invariant cache hit.
[2024-05-22 16:54:42] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-22 16:54:42] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2024-05-22 16:54:42] [INFO ] Invariant cache hit.
[2024-05-22 16:54:43] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 16:54:44] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2024-05-22 16:54:44] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2024-05-22 16:54:44] [INFO ] Invariant cache hit.
[2024-05-22 16:54:45] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3335 ms. Remains : 622/622 places, 1641/1641 transitions.
Built C files in :
/tmp/ltsmin8827756407288630214
[2024-05-22 16:54:45] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8827756407288630214
Running compilation step : cd /tmp/ltsmin8827756407288630214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8827756407288630214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8827756407288630214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 16:54:48] [INFO ] Flatten gal took : 101 ms
[2024-05-22 16:54:48] [INFO ] Flatten gal took : 102 ms
[2024-05-22 16:54:48] [INFO ] Time to serialize gal into /tmp/LTL17169778954063702207.gal : 9 ms
[2024-05-22 16:54:48] [INFO ] Time to serialize properties into /tmp/LTL11594252300071464247.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17169778954063702207.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15695309776871227336.hoa' '-atoms' '/tmp/LTL11594252300071464247.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11594252300071464247.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15695309776871227336.hoa
Detected timeout of ITS tools.
[2024-05-22 16:55:04] [INFO ] Flatten gal took : 100 ms
[2024-05-22 16:55:04] [INFO ] Flatten gal took : 91 ms
[2024-05-22 16:55:04] [INFO ] Time to serialize gal into /tmp/LTL13204189997907734172.gal : 13 ms
[2024-05-22 16:55:04] [INFO ] Time to serialize properties into /tmp/LTL15684708754478321187.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13204189997907734172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15684708754478321187.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((G(((!((!("((p167==1)&&(p1988==1))"))U(X("((p167==1)&&(p1988==1))"))))||("(p1202==0)"))||("(p3181==0)")))||(X(X("((p141==0)||(p...172
Formula 0 simplified : G(F(!"(p1202==0)" & !"(p3181==0)" & (!"((p167==1)&&(p1988==1))" U X"((p167==1)&&(p1988==1))")) & F!"((p141==0)||(p2061==0))")
Detected timeout of ITS tools.
[2024-05-22 16:55:19] [INFO ] Flatten gal took : 94 ms
[2024-05-22 16:55:19] [INFO ] Applying decomposition
[2024-05-22 16:55:19] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7841403222800534655.txt' '-o' '/tmp/graph7841403222800534655.bin' '-w' '/tmp/graph7841403222800534655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7841403222800534655.bin' '-l' '-1' '-v' '-w' '/tmp/graph7841403222800534655.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:55:19] [INFO ] Decomposing Gal with order
[2024-05-22 16:55:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:55:19] [INFO ] Removed a total of 4401 redundant transitions.
[2024-05-22 16:55:19] [INFO ] Flatten gal took : 114 ms
[2024-05-22 16:55:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 110 ms.
[2024-05-22 16:55:19] [INFO ] Time to serialize gal into /tmp/LTL10816951382097664989.gal : 9 ms
[2024-05-22 16:55:19] [INFO ] Time to serialize properties into /tmp/LTL15604149111978325354.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10816951382097664989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15604149111978325354.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G((G(((!((!("((i1.u2.p167==1)&&(i1.u64.p1988==1))"))U(X("((i1.u2.p167==1)&&(i1.u64.p1988==1))"))))||("(i10.u30.p1202==0)"))||("(i...228
Formula 0 simplified : G(F(!"(i10.u30.p1202==0)" & !"(i10.u183.p3181==0)" & (!"((i1.u2.p167==1)&&(i1.u64.p1988==1))" U X"((i1.u2.p167==1)&&(i1.u64.p1988==1...204
Reverse transition relation is NOT exact ! Due to transitions t1889_t1001_t1003_t1004_t1009, i1.t1382, i4.t128, i4.t125, i4.t121, i4.u6.t126, i4.u7.t123, i...822
Computing Next relation with stutter on 3.14573e+07 deadlock states
7 unique states visited
3 strongly connected components in search stack
16 transitions explored
7 items max in DFS search stack
532 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.45484,294400,1,0,886171,317,9793,1.10739e+06,278,881,115956
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property DLCround-PT-09b-LTLFireability-14 finished in 71404 ms.
FORMULA DLCround-PT-09b-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-22 16:55:27] [INFO ] Flatten gal took : 85 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1089848117987120981
[2024-05-22 16:55:27] [INFO ] Too many transitions (3989) to apply POR reductions. Disabling POR matrices.
[2024-05-22 16:55:27] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1089848117987120981
Running compilation step : cd /tmp/ltsmin1089848117987120981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 16:55:27] [INFO ] Applying decomposition
[2024-05-22 16:55:27] [INFO ] Flatten gal took : 110 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2048754498913305106.txt' '-o' '/tmp/graph2048754498913305106.bin' '-w' '/tmp/graph2048754498913305106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2048754498913305106.bin' '-l' '-1' '-v' '-w' '/tmp/graph2048754498913305106.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:55:28] [INFO ] Decomposing Gal with order
[2024-05-22 16:55:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:55:28] [INFO ] Removed a total of 3808 redundant transitions.
[2024-05-22 16:55:28] [INFO ] Flatten gal took : 183 ms
[2024-05-22 16:55:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 57 ms.
[2024-05-22 16:55:28] [INFO ] Time to serialize gal into /tmp/LTLFireability17556936964962827649.gal : 34 ms
[2024-05-22 16:55:28] [INFO ] Time to serialize properties into /tmp/LTLFireability9757389515432895739.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17556936964962827649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9757389515432895739.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((i19.i0.i0.u179.p758==1)&&(i5.u628.p2608==1))"))||(X(X(F("((i13.i1.i5.u269.p1093==1)&&(i13.i1.i10.u558.p2211==1))")))))))
Formula 0 simplified : G(F!"((i19.i0.i0.u179.p758==1)&&(i5.u628.p2608==1))" & XXG!"((i13.i1.i5.u269.p1093==1)&&(i13.i1.i10.u558.p2211==1))")
Compilation finished in 18936 ms.
Running link step : cd /tmp/ltsmin1089848117987120981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin1089848117987120981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 2999 ms.
FORMULA DLCround-PT-09b-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 459828 ms.

BK_STOP 1716396950723

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="DLCround-PT-09b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is DLCround-PT-09b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r131-smll-171624288400138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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