Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Champagne-PT-H07T2O, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.0K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 11:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 11:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Jun 6 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 193K Jun 5 20:08 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-00
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-01
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-02
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-03
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-04
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-05
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-06
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-07
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-08
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-09
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-10
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-11
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-12
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-13
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-14
FORMULA_NAME Champagne-PT-H07T2O-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749324885058

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 19:34:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 19:34:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:34:46] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-07 19:34:46] [INFO ] Transformed 1025 places.
[2025-06-07 19:34:46] [INFO ] Transformed 1282 transitions.
[2025-06-07 19:34:46] [INFO ] Found NUPN structural information;
[2025-06-07 19:34:46] [INFO ] Parsed PT model containing 1025 places and 1282 transitions and 3014 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H07T2O-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1025/1025 places, 1282/1282 transitions.
Discarding 181 places :
Symmetric choice reduction at 0 with 181 rule applications. Total rules 181 place count 844 transition count 1101
Iterating global reduction 0 with 181 rules applied. Total rules applied 362 place count 844 transition count 1101
Discarding 124 places :
Symmetric choice reduction at 0 with 124 rule applications. Total rules 486 place count 720 transition count 977
Iterating global reduction 0 with 124 rules applied. Total rules applied 610 place count 720 transition count 977
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 683 place count 647 transition count 904
Iterating global reduction 0 with 73 rules applied. Total rules applied 756 place count 647 transition count 904
Applied a total of 756 rules in 213 ms. Remains 647 /1025 variables (removed 378) and now considering 904/1282 (removed 378) transitions.
// Phase 1: matrix 904 rows 647 cols
[2025-06-07 19:34:46] [INFO ] Computed 27 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:34:47] [INFO ] Implicit Places using invariants in 362 ms returned []
[2025-06-07 19:34:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:34:47] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Running 903 sub problems to find dead transitions.
[2025-06-07 19:34:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (OVERLAPS) 1/647 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 903 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 647/1551 variables, and 27 constraints, problems are : Problem set: 0 solved, 903 unsolved in 30168 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/647 constraints, PredecessorRefiner: 903/903 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 903 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (OVERLAPS) 1/647 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 903 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:35:39] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/647 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 903 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/1551 variables, and 28 constraints, problems are : Problem set: 0 solved, 903 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/647 constraints, PredecessorRefiner: 0/903 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 903 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Starting structural reductions in LTL mode, iteration 1 : 647/1025 places, 904/1282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61476 ms. Remains : 647/1025 places, 904/1282 transitions.
Support contains 21 out of 647 places after structural reductions.
[2025-06-07 19:35:48] [INFO ] Flatten gal took : 75 ms
[2025-06-07 19:35:48] [INFO ] Flatten gal took : 39 ms
[2025-06-07 19:35:48] [INFO ] Input system was already deterministic with 904 transitions.
RANDOM walk for 29261 steps (39 resets) in 1027 ms. (28 steps per ms) remains 0/11 properties
FORMULA Champagne-PT-H07T2O-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 26 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 647 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 647/647 places, 904/904 transitions.
Graph (trivial) has 689 edges and 647 vertex of which 425 / 647 are part of one of the 27 SCC in 3 ms
Free SCC test removed 398 places
Ensure Unique test removed 443 transitions
Reduce isomorphic transitions removed 443 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 248 transition count 387
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 122 rules applied. Total rules applied 196 place count 175 transition count 338
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 220 place count 151 transition count 338
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 220 place count 151 transition count 337
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 222 place count 150 transition count 337
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 242 place count 130 transition count 258
Iterating global reduction 3 with 20 rules applied. Total rules applied 262 place count 130 transition count 258
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 278 place count 130 transition count 242
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 374 place count 82 transition count 194
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 378 place count 78 transition count 176
Iterating global reduction 4 with 4 rules applied. Total rules applied 382 place count 78 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 386 place count 78 transition count 172
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 388 place count 76 transition count 170
Applied a total of 388 rules in 64 ms. Remains 76 /647 variables (removed 571) and now considering 170/904 (removed 734) transitions.
[2025-06-07 19:35:49] [INFO ] Flow matrix only has 73 transitions (discarded 97 similar events)
// Phase 1: matrix 73 rows 76 cols
[2025-06-07 19:35:49] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:35:49] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-07 19:35:49] [INFO ] Flow matrix only has 73 transitions (discarded 97 similar events)
[2025-06-07 19:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:35:49] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:35:49] [INFO ] Redundant transitions in 4 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-07 19:35:49] [INFO ] Flow matrix only has 73 transitions (discarded 97 similar events)
[2025-06-07 19:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 72/148 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/149 variables, and 103 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2100 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 72/148 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 96/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/149 variables, and 199 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2292 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4406ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4407ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/647 places, 170/904 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4611 ms. Remains : 76/647 places, 170/904 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T2O-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H07T2O-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLCardinality-02 finished in 4926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 647 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 647/647 places, 904/904 transitions.
Graph (trivial) has 687 edges and 647 vertex of which 422 / 647 are part of one of the 29 SCC in 2 ms
Free SCC test removed 393 places
Ensure Unique test removed 434 transitions
Reduce isomorphic transitions removed 434 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 253 transition count 395
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 124 rules applied. Total rules applied 199 place count 179 transition count 345
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 224 place count 154 transition count 345
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 244 place count 134 transition count 266
Iterating global reduction 3 with 20 rules applied. Total rules applied 264 place count 134 transition count 266
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 280 place count 134 transition count 250
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 378 place count 85 transition count 201
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 382 place count 81 transition count 183
Iterating global reduction 4 with 4 rules applied. Total rules applied 386 place count 81 transition count 183
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 390 place count 81 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 392 place count 79 transition count 177
Applied a total of 392 rules in 45 ms. Remains 79 /647 variables (removed 568) and now considering 177/904 (removed 727) transitions.
[2025-06-07 19:35:53] [INFO ] Flow matrix only has 76 transitions (discarded 101 similar events)
// Phase 1: matrix 76 rows 79 cols
[2025-06-07 19:35:53] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:35:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-07 19:35:54] [INFO ] Flow matrix only has 76 transitions (discarded 101 similar events)
[2025-06-07 19:35:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:35:54] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:35:54] [INFO ] Redundant transitions in 6 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-07 19:35:54] [INFO ] Flow matrix only has 76 transitions (discarded 101 similar events)
[2025-06-07 19:35:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 75/154 variables, 79/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/155 variables, and 106 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2140 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 75/154 variables, 79/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/155 variables, and 207 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2466 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4623ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 4624ms
Starting structural reductions in SI_LTL mode, iteration 1 : 79/647 places, 177/904 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4811 ms. Remains : 79/647 places, 177/904 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T2O-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T2O-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLCardinality-03 finished in 4869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F((p1&&F(p2)))))||p0))))'
Support contains 5 out of 647 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 647/647 places, 904/904 transitions.
Graph (trivial) has 682 edges and 647 vertex of which 412 / 647 are part of one of the 27 SCC in 1 ms
Free SCC test removed 385 places
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 427 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 261 transition count 400
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 126 rules applied. Total rules applied 203 place count 185 transition count 350
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 228 place count 160 transition count 350
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 228 place count 160 transition count 347
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 234 place count 157 transition count 347
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 253 place count 138 transition count 269
Iterating global reduction 3 with 19 rules applied. Total rules applied 272 place count 138 transition count 269
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 288 place count 138 transition count 253
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 388 place count 88 transition count 203
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 390 place count 86 transition count 197
Iterating global reduction 4 with 2 rules applied. Total rules applied 392 place count 86 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 394 place count 86 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 396 place count 85 transition count 199
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 401 place count 85 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 402 place count 84 transition count 189
Iterating global reduction 5 with 1 rules applied. Total rules applied 403 place count 84 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 404 place count 84 transition count 188
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 406 place count 82 transition count 186
Applied a total of 406 rules in 46 ms. Remains 82 /647 variables (removed 565) and now considering 186/904 (removed 718) transitions.
[2025-06-07 19:35:58] [INFO ] Flow matrix only has 83 transitions (discarded 103 similar events)
// Phase 1: matrix 83 rows 82 cols
[2025-06-07 19:35:58] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:35:58] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-07 19:35:58] [INFO ] Flow matrix only has 83 transitions (discarded 103 similar events)
[2025-06-07 19:35:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:35:59] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:35:59] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-07 19:35:59] [INFO ] Flow matrix only has 83 transitions (discarded 103 similar events)
[2025-06-07 19:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 2/82 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 82/164 variables, 82/109 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/165 variables, and 109 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2361 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 2/82 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 82/164 variables, 82/109 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 109/218 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/165 variables, and 218 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2510 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4881ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 4881ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/647 places, 186/904 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5113 ms. Remains : 82/647 places, 186/904 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H07T2O-LTLCardinality-04
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H07T2O-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLCardinality-04 finished in 5293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 647 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 647/647 places, 904/904 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 635 transition count 892
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 635 transition count 892
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 628 transition count 885
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 628 transition count 885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 626 transition count 883
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 626 transition count 883
Applied a total of 42 rules in 58 ms. Remains 626 /647 variables (removed 21) and now considering 883/904 (removed 21) transitions.
// Phase 1: matrix 883 rows 626 cols
[2025-06-07 19:36:04] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:36:04] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-07 19:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:36:04] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 882 sub problems to find dead transitions.
[2025-06-07 19:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:36:32] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1509 variables, and 28 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 4 (OVERLAPS) 883/1509 variables, 626/654 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1509 variables, 882/1536 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:37:01] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:37:01] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:37:02] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:37:04] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:37:04] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/1509 variables, and 1541 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 626/647 places, 883/904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60761 ms. Remains : 626/647 places, 883/904 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T2O-LTLCardinality-07
Stuttering criterion allowed to conclude after 798 steps with 0 reset in 4 ms.
FORMULA Champagne-PT-H07T2O-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLCardinality-07 finished in 60921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U X(X(X(p1)))))&&X(p2)))'
Support contains 6 out of 647 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 647/647 places, 904/904 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 635 transition count 892
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 635 transition count 892
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 629 transition count 886
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 629 transition count 886
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 626 transition count 883
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 626 transition count 883
Applied a total of 42 rules in 43 ms. Remains 626 /647 variables (removed 21) and now considering 883/904 (removed 21) transitions.
// Phase 1: matrix 883 rows 626 cols
[2025-06-07 19:37:05] [INFO ] Computed 27 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:37:05] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-07 19:37:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:37:05] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 882 sub problems to find dead transitions.
[2025-06-07 19:37:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1509 variables, and 27 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
SMT process timed out in 60164ms, After SMT, problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 626/647 places, 883/904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60848 ms. Remains : 626/647 places, 883/904 transitions.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T2O-LTLCardinality-08
Product exploration explored 100000 steps with 28510 reset in 231 ms.
Product exploration explored 100000 steps with 28479 reset in 245 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 12 states, 18 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (54 resets) in 280 ms. (142 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
[2025-06-07 19:38:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 197/201 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 425/626 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 883/1509 variables, 626/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1509 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1509 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1509/1509 variables, and 653 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 197/201 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 425/626 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 883/1509 variables, 626/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1509 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1509 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1509 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1509/1509 variables, and 654 constraints, problems are : Problem set: 0 solved, 1 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 724ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13420 steps, including 100 resets, run visited all 1 properties in 38 ms. (steps per millisecond=353 )
Parikh walk visited 1 properties in 42 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 10 states, 14 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 408 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 626 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 883/883 transitions.
Applied a total of 0 rules in 18 ms. Remains 626 /626 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2025-06-07 19:38:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:38:09] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-07 19:38:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:38:09] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 882 sub problems to find dead transitions.
[2025-06-07 19:38:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1509 variables, and 27 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1509 variables, and 27 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/882 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Finished structural reductions in LTL mode , in 1 iterations and 60662 ms. Remains : 626/626 places, 883/883 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 10 states, 14 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 436 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (56 resets) in 216 ms. (184 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
[2025-06-07 19:39:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 197/201 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 425/626 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 883/1509 variables, 626/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1509 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1509 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1509/1509 variables, and 653 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 197/201 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 425/626 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 883/1509 variables, 626/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1509 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1509 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1509 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1509/1509 variables, and 654 constraints, problems are : Problem set: 0 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 697ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6636 steps, including 49 resets, run visited all 1 properties in 18 ms. (steps per millisecond=368 )
Parikh walk visited 1 properties in 18 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 10 states, 14 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 435 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 456 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 428 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 19968 reset in 146 ms.
Product exploration explored 100000 steps with 19951 reset in 153 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 425 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 883/883 transitions.
Graph (trivial) has 664 edges and 626 vertex of which 405 / 626 are part of one of the 27 SCC in 2 ms
Free SCC test removed 378 places
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 421 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 248 transition count 462
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 95 place count 248 transition count 437
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 95 place count 248 transition count 437
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 121 place count 248 transition count 437
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 168 place count 201 transition count 327
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 215 place count 201 transition count 327
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 232 place count 201 transition count 310
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 249 place count 184 transition count 293
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 266 place count 184 transition count 293
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 3 with 49 rules applied. Total rules applied 315 place count 184 transition count 293
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 342 place count 157 transition count 260
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 369 place count 157 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 370 place count 157 transition count 259
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 371 place count 156 transition count 258
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 372 place count 156 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 373 place count 156 transition count 262
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 374 place count 155 transition count 260
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 375 place count 155 transition count 260
Deduced a syphon composed of 71 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 377 place count 155 transition count 258
Deduced a syphon composed of 71 places in 0 ms
Applied a total of 377 rules in 65 ms. Remains 155 /626 variables (removed 471) and now considering 258/883 (removed 625) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:39:13] [INFO ] Redundant transitions in 2 ms returned []
Running 257 sub problems to find dead transitions.
[2025-06-07 19:39:13] [INFO ] Flow matrix only has 155 transitions (discarded 103 similar events)
// Phase 1: matrix 155 rows 155 cols
[2025-06-07 19:39:13] [INFO ] Computed 27 invariants in 1 ms
[2025-06-07 19:39:13] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:15] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:15] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:15] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:15] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:15] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:15] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:15] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:15] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:15] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:15] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/47 constraints. Problems are: Problem set: 59 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 7/54 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 154/309 variables, 155/209 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 22/231 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/231 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 1/310 variables, 1/232 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/232 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/232 constraints. Problems are: Problem set: 72 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 232 constraints, problems are : Problem set: 72 solved, 185 unsolved in 10861 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 155/155 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 72 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 72/155 variables, 27/27 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 27/54 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 154/309 variables, 155/209 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 22/231 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 185/416 constraints. Problems are: Problem set: 72 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:39:29] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 1/417 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/417 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 1/310 variables, 1/418 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/418 constraints. Problems are: Problem set: 72 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 0/310 variables, 0/418 constraints. Problems are: Problem set: 72 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 418 constraints, problems are : Problem set: 72 solved, 185 unsolved in 29649 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 155/155 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 185/257 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40535ms problems are : Problem set: 72 solved, 185 unsolved
Search for dead transitions found 72 dead transitions in 40536ms
Found 72 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 72 transitions
Dead transitions reduction (with SMT) removed 72 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 155/626 places, 186/883 transitions.
Graph (complete) has 1061 edges and 155 vertex of which 84 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.3 ms
Discarding 71 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 84 /155 variables (removed 71) and now considering 186/186 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/626 places, 186/883 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40627 ms. Remains : 84/626 places, 186/883 transitions.
Built C files in :
/tmp/ltsmin9491895589992483449
[2025-06-07 19:39:54] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9491895589992483449
Running compilation step : cd /tmp/ltsmin9491895589992483449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1456 ms.
Running link step : cd /tmp/ltsmin9491895589992483449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9491895589992483449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16583211248280275480.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 883/883 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 625 transition count 882
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 625 transition count 882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 624 transition count 881
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 624 transition count 881
Applied a total of 4 rules in 38 ms. Remains 624 /626 variables (removed 2) and now considering 881/883 (removed 2) transitions.
// Phase 1: matrix 881 rows 624 cols
[2025-06-07 19:40:09] [INFO ] Computed 27 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:40:09] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-07 19:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:40:09] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 880 sub problems to find dead transitions.
[2025-06-07 19:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (OVERLAPS) 1/624 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1505 variables, and 27 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (OVERLAPS) 1/624 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 624/1505 variables, and 27 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 624/626 places, 881/883 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60658 ms. Remains : 624/626 places, 881/883 transitions.
Built C files in :
/tmp/ltsmin4359219099303526723
[2025-06-07 19:41:10] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4359219099303526723
Running compilation step : cd /tmp/ltsmin4359219099303526723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1311 ms.
Running link step : cd /tmp/ltsmin4359219099303526723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4359219099303526723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1299512367603604862.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 19:41:25] [INFO ] Flatten gal took : 32 ms
[2025-06-07 19:41:25] [INFO ] Flatten gal took : 29 ms
[2025-06-07 19:41:25] [INFO ] Time to serialize gal into /tmp/LTL9978678448299858425.gal : 7 ms
[2025-06-07 19:41:25] [INFO ] Time to serialize properties into /tmp/LTL2898055441866410320.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9978678448299858425.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7879592953399749371.hoa' '-atoms' '/tmp/LTL2898055441866410320.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2898055441866410320.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7879592953399749371.hoa
Detected timeout of ITS tools.
[2025-06-07 19:41:40] [INFO ] Flatten gal took : 27 ms
[2025-06-07 19:41:40] [INFO ] Flatten gal took : 26 ms
[2025-06-07 19:41:40] [INFO ] Time to serialize gal into /tmp/LTL3826250408286705035.gal : 5 ms
[2025-06-07 19:41:40] [INFO ] Time to serialize properties into /tmp/LTL8854917369672329946.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3826250408286705035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8854917369672329946.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G((F("((p691==0)||(p267==1))"))U(X(X(X("((p992==0)||(p52==1))"))))))&&(X("((p424==0)||(p441==1))"))))
Formula 0 simplified : F(G!"((p691==0)||(p267==1))" R XXX!"((p992==0)||(p52==1))") | X!"((p424==0)||(p441==1))"
Detected timeout of ITS tools.
[2025-06-07 19:41:55] [INFO ] Flatten gal took : 25 ms
[2025-06-07 19:41:55] [INFO ] Applying decomposition
[2025-06-07 19:41:55] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9133828194537841701.txt' '-o' '/tmp/graph9133828194537841701.bin' '-w' '/tmp/graph9133828194537841701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9133828194537841701.bin' '-l' '-1' '-v' '-w' '/tmp/graph9133828194537841701.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:41:55] [INFO ] Decomposing Gal with order
[2025-06-07 19:41:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:41:55] [INFO ] Removed a total of 534 redundant transitions.
[2025-06-07 19:41:56] [INFO ] Flatten gal took : 89 ms
[2025-06-07 19:41:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 13 ms.
[2025-06-07 19:41:56] [INFO ] Time to serialize gal into /tmp/LTL11828860614119054410.gal : 10 ms
[2025-06-07 19:41:56] [INFO ] Time to serialize properties into /tmp/LTL17464274951701212522.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11828860614119054410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17464274951701212522.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G((F("((i19.i0.i1.u160.p691==0)||(i0.u65.p267==1))"))U(X(X(X("((i27.u234.p992==0)||(i2.u13.p52==1))"))))))&&(X("((i12.u102.p424==0...182
Formula 0 simplified : F(G!"((i19.i0.i1.u160.p691==0)||(i0.u65.p267==1))" R XXX!"((i27.u234.p992==0)||(i2.u13.p52==1))") | X!"((i12.u102.p424==0)||(i12.u10...167
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H07T2O-LTLCardinality-08 finished in 306060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U X(X(X(p1)))))&&X(p2)))'
[2025-06-07 19:42:11] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14216425856782357960
[2025-06-07 19:42:11] [INFO ] Applying decomposition
[2025-06-07 19:42:11] [INFO ] Computing symmetric may disable matrix : 904 transitions.
[2025-06-07 19:42:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 19:42:11] [INFO ] Computing symmetric may enable matrix : 904 transitions.
[2025-06-07 19:42:11] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 19:42:11] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14208764157998523159.txt' '-o' '/tmp/graph14208764157998523159.bin' '-w' '/tmp/graph14208764157998523159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14208764157998523159.bin' '-l' '-1' '-v' '-w' '/tmp/graph14208764157998523159.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:42:11] [INFO ] Decomposing Gal with order
[2025-06-07 19:42:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:42:11] [INFO ] Removed a total of 532 redundant transitions.
[2025-06-07 19:42:11] [INFO ] Computing Do-Not-Accords matrix : 904 transitions.
[2025-06-07 19:42:11] [INFO ] Flatten gal took : 39 ms
[2025-06-07 19:42:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 9 ms.
[2025-06-07 19:42:11] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 19:42:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality9032430391818383268.gal : 6 ms
[2025-06-07 19:42:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality5621404440568485660.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9032430391818383268.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5621404440568485660.ltl' '-c' '-stutter-deadlock'
[2025-06-07 19:42:11] [INFO ] Built C files in 272ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14216425856782357960
Running compilation step : cd /tmp/ltsmin14216425856782357960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G((F("((i19.i0.i0.u169.p691==0)||(i12.i0.i0.u70.p267==1))"))U(X(X(X("((i27.u248.p992==0)||(i1.u13.p52==1))"))))))&&(X("((i11.u108....189
Formula 0 simplified : F(G!"((i19.i0.i0.u169.p691==0)||(i12.i0.i0.u70.p267==1))" R XXX!"((i27.u248.p992==0)||(i1.u13.p52==1))") | X!"((i11.u108.p424==0)||(...174
Compilation finished in 2465 ms.
Running link step : cd /tmp/ltsmin14216425856782357960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin14216425856782357960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((<>((LTLAPp0==true)) U X(X(X((LTLAPp1==true))))))&&X((LTLAPp2==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t11, t65, t116, t141, t191, t243, t294, t344, t394, t521, t652, i0.t681, i1.t657, i2.t630, i3...558
Computing Next relation with stutter on 3.48678e+09 deadlock states
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 items max in DFS search stack
988 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,9.95449,204836,1,0,423877,617,8387,588831,250,1425,944330
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Champagne-PT-H07T2O-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 466634 ms.

BK_STOP 1749325352962

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="Champagne-PT-H07T2O"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H07T2O, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339200091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H07T2O.tgz
mv Champagne-PT-H07T2O execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;