Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 05:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 05:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 13 05:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 13 05:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 110K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716709123056

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-050050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-26 07:38:44] [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]
[2024-05-26 07:38:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 07:38:44] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-26 07:38:44] [INFO ] Transformed 254 places.
[2024-05-26 07:38:44] [INFO ] Transformed 203 transitions.
[2024-05-26 07:38:44] [INFO ] Parsed PT model containing 254 places and 203 transitions and 608 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-050050-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 31 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-26 07:38:44] [INFO ] Computed 102 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6008 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6970 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 13098ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 13117ms
[2024-05-26 07:38:57] [INFO ] Invariant cache hit.
[2024-05-26 07:38:57] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-26 07:38:57] [INFO ] Invariant cache hit.
[2024-05-26 07:38:57] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:38:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5436 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9450 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14904ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14906ms
Finished structural reductions in LTL mode , in 1 iterations and 28360 ms. Remains : 254/254 places, 203/203 transitions.
Support contains 43 out of 254 places after structural reductions.
[2024-05-26 07:39:13] [INFO ] Flatten gal took : 41 ms
[2024-05-26 07:39:13] [INFO ] Flatten gal took : 16 ms
[2024-05-26 07:39:13] [INFO ] Input system was already deterministic with 203 transitions.
RANDOM walk for 40069 steps (8 resets) in 469 ms. (85 steps per ms) remains 18/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
[2024-05-26 07:39:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 61/86 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 71/157 variables, 86/104 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 300/457 variables, 168/272 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 84/356 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 18 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 61/86 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 71/157 variables, 86/104 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 300/457 variables, 168/273 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 84/357 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 17/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/457 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 374 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 1569ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 15 different solutions.
Finished Parikh walk after 9769 steps, including 0 resets, run visited all 18 properties in 219 ms. (steps per millisecond=44 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(((p1 U (G(p1)||(p1&&G(p2)))) U (G(p1)||(!p0&&(p1 U (G(p1)||(p1&&G(p2))))))))))'
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 16 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:39:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5456 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9437 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14916ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14919ms
[2024-05-26 07:39:30] [INFO ] Invariant cache hit.
[2024-05-26 07:39:30] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-26 07:39:30] [INFO ] Invariant cache hit.
[2024-05-26 07:39:30] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:39:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5355 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9356 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14727ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14729ms
Finished structural reductions in LTL mode , in 1 iterations and 29933 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 527 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-00
Product exploration explored 100000 steps with 1 reset in 874 ms.
Product exploration explored 100000 steps with 2 reset in 857 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 154 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40093 steps (8 resets) in 177 ms. (225 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
[2024-05-26 07:39:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 52/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 57/115 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 342/457 variables, 196/258 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 98/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 13 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 52/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 57/115 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 342/457 variables, 196/258 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 98/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 13/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/457 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 369 constraints, problems are : Problem set: 0 solved, 13 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 1079ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 9 different solutions.
Finished Parikh walk after 156852 steps, including 34 resets, run visited all 3 properties in 635 ms. (steps per millisecond=247 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 6429 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 25 factoid took 716 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 400 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 7 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:39:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5434 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9583 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 15034ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 15037ms
[2024-05-26 07:40:13] [INFO ] Invariant cache hit.
[2024-05-26 07:40:13] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-26 07:40:13] [INFO ] Invariant cache hit.
[2024-05-26 07:40:13] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:40:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5442 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9257 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14721ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14723ms
Finished structural reductions in LTL mode , in 1 iterations and 30015 ms. Remains : 254/254 places, 203/203 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 151 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40067 steps (8 resets) in 86 ms. (460 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
[2024-05-26 07:40:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 52/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 57/115 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 342/457 variables, 196/258 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 98/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 13 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 52/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 57/115 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 342/457 variables, 196/258 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 98/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 13/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/457 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 369 constraints, problems are : Problem set: 0 solved, 13 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 1026ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 9 different solutions.
Finished Parikh walk after 4319 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=227 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 10981 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 24 factoid took 804 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 394 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 377 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 382 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 691 ms.
Product exploration explored 100000 steps with 1 reset in 830 ms.
Applying partial POR strategy [false, true, false, true, true, false, false, true, false]
Stuttering acceptance computed with spot in 396 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 5 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 98 place count 158 transition count 108
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 98 rules in 38 ms. Remains 158 /254 variables (removed 96) and now considering 108/203 (removed 95) transitions.
Running 104 sub problems to find dead transitions.
// Phase 1: matrix 108 rows 158 cols
[2024-05-26 07:40:45] [INFO ] Computed 54 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 2/158 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 4 (OVERLAPS) 107/265 variables, 158/212 constraints. Problems are: Problem set: 50 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/212 constraints. Problems are: Problem set: 50 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/212 constraints. Problems are: Problem set: 50 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/266 variables, and 212 constraints, problems are : Problem set: 50 solved, 54 unsolved in 1826 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 50 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 50 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 50 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 52/158 variables, 52/54 constraints. Problems are: Problem set: 50 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/54 constraints. Problems are: Problem set: 50 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 107/265 variables, 158/212 constraints. Problems are: Problem set: 50 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 54/266 constraints. Problems are: Problem set: 50 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/266 constraints. Problems are: Problem set: 50 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/266 constraints. Problems are: Problem set: 50 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/266 variables, and 266 constraints, problems are : Problem set: 50 solved, 54 unsolved in 1136 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 54/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 2980ms problems are : Problem set: 50 solved, 54 unsolved
Search for dead transitions found 50 dead transitions in 2982ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 50 transitions.
[2024-05-26 07:40:48] [INFO ] Redundant transitions in 17 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 158/254 places, 58/203 transitions.
Graph (complete) has 218 edges and 158 vertex of which 108 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 0 output transitions
Reduce places removed 50 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 58 transition count 58
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 40 place count 58 transition count 58
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 58 transition count 58
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 77 place count 23 transition count 23
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 112 place count 23 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 23 transition count 23
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 22 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 22 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 115 rules in 34 ms. Remains 22 /158 variables (removed 136) and now considering 22/58 (removed 36) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/254 places, 22/203 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3083 ms. Remains : 22/254 places, 22/203 transitions.
Built C files in :
/tmp/ltsmin1074996428338549542
[2024-05-26 07:40:48] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1074996428338549542
Running compilation step : cd /tmp/ltsmin1074996428338549542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 593 ms.
Running link step : cd /tmp/ltsmin1074996428338549542;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1074996428338549542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18378672777471117495.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-26 07:41:04] [INFO ] Computed 102 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5523 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6658 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 12209ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 12212ms
[2024-05-26 07:41:16] [INFO ] Invariant cache hit.
[2024-05-26 07:41:16] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-26 07:41:16] [INFO ] Invariant cache hit.
[2024-05-26 07:41:16] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:41:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5534 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9268 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14818ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14820ms
Finished structural reductions in LTL mode , in 1 iterations and 27314 ms. Remains : 254/254 places, 203/203 transitions.
Built C files in :
/tmp/ltsmin3126365863082218907
[2024-05-26 07:41:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3126365863082218907
Running compilation step : cd /tmp/ltsmin3126365863082218907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 394 ms.
Running link step : cd /tmp/ltsmin3126365863082218907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3126365863082218907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13337643720323443555.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 07:41:46] [INFO ] Flatten gal took : 13 ms
[2024-05-26 07:41:46] [INFO ] Flatten gal took : 11 ms
[2024-05-26 07:41:46] [INFO ] Time to serialize gal into /tmp/LTL15900193214438208272.gal : 3 ms
[2024-05-26 07:41:46] [INFO ] Time to serialize properties into /tmp/LTL10389709820673754597.prop : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15900193214438208272.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12153343395376703408.hoa' '-atoms' '/tmp/LTL10389709820673754597.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10389709820673754597.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12153343395376703408.hoa
Detected timeout of ITS tools.
[2024-05-26 07:42:01] [INFO ] Flatten gal took : 11 ms
[2024-05-26 07:42:01] [INFO ] Flatten gal took : 11 ms
[2024-05-26 07:42:01] [INFO ] Time to serialize gal into /tmp/LTL16943623463221106354.gal : 2 ms
[2024-05-26 07:42:01] [INFO ] Time to serialize properties into /tmp/LTL8476232851331765880.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16943623463221106354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8476232851331765880.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p106<=p124)"))U(X((("(p24>p141)")U((G("(p24>p141)"))||(("(p24>p141)")&&(G("(p81>psecond)")))))U((G("(p24>p141)"))||(("(p106>p1...244
Formula 0 simplified : G!"(p106<=p124)" R X((F!"(p81>psecond)" U !"(p24>p141)") R (F!"(p24>p141)" & (!"(p106>p124)" | (F!"(p81>psecond)" U !"(p24>p141)")))...156
Detected timeout of ITS tools.
[2024-05-26 07:42:16] [INFO ] Flatten gal took : 22 ms
[2024-05-26 07:42:16] [INFO ] Applying decomposition
[2024-05-26 07:42:16] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17382401918746248957.txt' '-o' '/tmp/graph17382401918746248957.bin' '-w' '/tmp/graph17382401918746248957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17382401918746248957.bin' '-l' '-1' '-v' '-w' '/tmp/graph17382401918746248957.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:42:16] [INFO ] Decomposing Gal with order
[2024-05-26 07:42:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:42:16] [INFO ] Flatten gal took : 39 ms
[2024-05-26 07:42:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-26 07:42:16] [INFO ] Time to serialize gal into /tmp/LTL2743178558487360548.gal : 4 ms
[2024-05-26 07:42:16] [INFO ] Time to serialize properties into /tmp/LTL3830434766848232867.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2743178558487360548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3830434766848232867.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(gu61.p106<=gu61.p124)"))U(X((("(gu12.p24>gu12.p141)")U((G("(gu12.p24>gu12.p141)"))||(("(gu12.p24>gu12.p141)")&&(G("(gu40.p81>g...354
Formula 0 simplified : G!"(gu61.p106<=gu61.p124)" R X((F!"(gu40.p81>gu40.psecond)" U !"(gu12.p24>gu12.p141)") R (F!"(gu12.p24>gu12.p141)" & (!"(gu61.p106>g...226
Detected timeout of ITS tools.
Treatment of property RefineWMG-PT-050050-LTLCardinality-00 finished in 196413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X((p1||F(G(p1))))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 145 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 195 place count 60 transition count 59
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 238 place count 60 transition count 16
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 44 rules applied. Total rules applied 282 place count 17 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 283 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 283 place count 16 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 287 place count 14 transition count 13
Applied a total of 287 rules in 14 ms. Remains 14 /254 variables (removed 240) and now considering 13/203 (removed 190) transitions.
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 14 cols
[2024-05-26 07:42:32] [INFO ] Computed 5 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/26 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/27 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/26 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/27 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 499ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 499ms
[2024-05-26 07:42:32] [INFO ] Invariant cache hit.
[2024-05-26 07:42:32] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-26 07:42:32] [INFO ] Invariant cache hit.
[2024-05-26 07:42:32] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-26 07:42:32] [INFO ] Redundant transitions in 12 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-26 07:42:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/26 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/27 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/26 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/27 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 254ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/254 places, 13/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 844 ms. Remains : 14/254 places, 13/203 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 188 ms.
Product exploration explored 100000 steps with 0 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40158 steps (8 resets) in 22 ms. (1746 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 19 ms. (2000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 16 ms. (2353 steps per ms) remains 3/3 properties
[2024-05-26 07:42:33] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/23 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/26 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/27 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/23 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/26 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/27 variables, and 22 constraints, problems are : Problem set: 0 solved, 3 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 340 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=28 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 11 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Running 9 sub problems to find dead transitions.
[2024-05-26 07:42:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/26 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/27 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/26 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/27 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 191ms
[2024-05-26 07:42:34] [INFO ] Invariant cache hit.
[2024-05-26 07:42:34] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-26 07:42:34] [INFO ] Invariant cache hit.
[2024-05-26 07:42:34] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-26 07:42:34] [INFO ] Redundant transitions in 11 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-26 07:42:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/26 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/27 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/26 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/27 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 162ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 432 ms. Remains : 14/14 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40099 steps (8 resets) in 22 ms. (1743 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 3/3 properties
[2024-05-26 07:42:35] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/23 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/26 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/27 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/23 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/26 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/27 variables, and 22 constraints, problems are : Problem set: 0 solved, 3 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 337 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=112 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 288 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 116 ms.
Built C files in :
/tmp/ltsmin10464840620978882633
[2024-05-26 07:42:35] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2024-05-26 07:42:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:42:35] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2024-05-26 07:42:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:42:35] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2024-05-26 07:42:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:42:35] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10464840620978882633
Running compilation step : cd /tmp/ltsmin10464840620978882633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 94 ms.
Running link step : cd /tmp/ltsmin10464840620978882633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10464840620978882633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12888649607976062823.hoa' '--buchi-type=spotba'
LTSmin run took 4757 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-050050-LTLCardinality-01 finished in 8736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1 U G(!p1))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 143 edges and 254 vertex of which 94 / 254 are part of one of the 47 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 160 transition count 110
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 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 194 place count 62 transition count 61
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 41 rules applied. Total rules applied 235 place count 62 transition count 20
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 276 place count 21 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 276 place count 21 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 284 place count 17 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 286 place count 16 transition count 15
Applied a total of 286 rules in 8 ms. Remains 16 /254 variables (removed 238) and now considering 15/203 (removed 188) transitions.
Running 10 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 16 cols
[2024-05-26 07:42:40] [INFO ] Computed 6 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 14/30 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/31 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 14/30 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/31 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 201ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 201ms
[2024-05-26 07:42:41] [INFO ] Invariant cache hit.
[2024-05-26 07:42:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-26 07:42:41] [INFO ] Invariant cache hit.
[2024-05-26 07:42:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-26 07:42:41] [INFO ] Redundant transitions in 16 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-26 07:42:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 14/30 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/31 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 14/30 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/31 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/254 places, 15/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 434 ms. Remains : 16/254 places, 15/203 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-02
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-02 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p0)))||X(F(p1))||G(p2)||(p2&&F(p3))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-26 07:42:41] [INFO ] Computed 102 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5501 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6774 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 12323ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 12324ms
[2024-05-26 07:42:53] [INFO ] Invariant cache hit.
[2024-05-26 07:42:53] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-26 07:42:53] [INFO ] Invariant cache hit.
[2024-05-26 07:42:53] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:42:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5562 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9533 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 15141ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 15143ms
Finished structural reductions in LTL mode , in 1 iterations and 27757 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-03
Product exploration explored 100000 steps with 16 reset in 668 ms.
Stack based approach found an accepted trace after 235 steps with 0 reset with depth 236 and stack size 236 in 2 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-03 finished in 28677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p0 U p1)||X(F(p2))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 144 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
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 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 192 place count 62 transition count 60
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 41 rules applied. Total rules applied 233 place count 62 transition count 19
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 274 place count 21 transition count 19
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 274 place count 21 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 282 place count 17 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 284 place count 16 transition count 14
Applied a total of 284 rules in 11 ms. Remains 16 /254 variables (removed 238) and now considering 14/203 (removed 189) transitions.
Running 10 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-05-26 07:43:09] [INFO ] Computed 6 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 13/29 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/30 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 13/29 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/30 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 205ms
[2024-05-26 07:43:10] [INFO ] Invariant cache hit.
[2024-05-26 07:43:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-26 07:43:10] [INFO ] Invariant cache hit.
[2024-05-26 07:43:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-26 07:43:10] [INFO ] Redundant transitions in 10 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-26 07:43:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 13/29 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/30 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 13/29 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/30 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 181ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/254 places, 14/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 486 ms. Remains : 16/254 places, 14/203 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-04
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-04 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (p1&&X(X(G(p0)))))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-26 07:43:10] [INFO ] Computed 102 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5422 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6739 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 12191ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 12193ms
[2024-05-26 07:43:22] [INFO ] Invariant cache hit.
[2024-05-26 07:43:22] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-26 07:43:22] [INFO ] Invariant cache hit.
[2024-05-26 07:43:23] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:43:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5402 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9343 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14783ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14784ms
Finished structural reductions in LTL mode , in 1 iterations and 27256 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-05 finished in 27419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 148 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 199 place count 56 transition count 56
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 1 with 47 rules applied. Total rules applied 246 place count 56 transition count 9
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 293 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 293 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 297 place count 7 transition count 7
Applied a total of 297 rules in 11 ms. Remains 7 /254 variables (removed 247) and now considering 7/203 (removed 196) transitions.
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-26 07:43:37] [INFO ] Computed 3 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 96ms
[2024-05-26 07:43:38] [INFO ] Invariant cache hit.
[2024-05-26 07:43:38] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-26 07:43:38] [INFO ] Invariant cache hit.
[2024-05-26 07:43:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-26 07:43:38] [INFO ] Redundant transitions in 9 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-26 07:43:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/254 places, 7/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 263 ms. Remains : 7/254 places, 7/203 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-06 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X((p1&&G(p2))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-26 07:43:38] [INFO ] Computed 102 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5359 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6670 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 12067ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 12069ms
[2024-05-26 07:43:50] [INFO ] Invariant cache hit.
[2024-05-26 07:43:50] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-26 07:43:50] [INFO ] Invariant cache hit.
[2024-05-26 07:43:50] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:43:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5312 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9247 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14596ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14597ms
Finished structural reductions in LTL mode , in 1 iterations and 26920 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-07 finished in 27140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((!(p0 U p1)&&G(F(p2))))&&p0)))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 193 place count 60 transition count 58
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 236 place count 60 transition count 15
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 279 place count 17 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 279 place count 17 transition count 12
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 285 place count 14 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 13 transition count 11
Applied a total of 287 rules in 10 ms. Remains 13 /254 variables (removed 241) and now considering 11/203 (removed 192) transitions.
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-26 07:44:05] [INFO ] Computed 5 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 138ms
[2024-05-26 07:44:05] [INFO ] Invariant cache hit.
[2024-05-26 07:44:05] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 07:44:05] [INFO ] Invariant cache hit.
[2024-05-26 07:44:05] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-26 07:44:05] [INFO ] Redundant transitions in 8 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-26 07:44:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/254 places, 11/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 13/254 places, 11/203 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p2) p1), p1, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-08 finished in 478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 196 place count 58 transition count 57
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 45 rules applied. Total rules applied 241 place count 58 transition count 12
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 286 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 286 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 290 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 292 place count 10 transition count 9
Applied a total of 292 rules in 7 ms. Remains 10 /254 variables (removed 244) and now considering 9/203 (removed 194) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-26 07:44:06] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 20 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 121ms
[2024-05-26 07:44:06] [INFO ] Invariant cache hit.
[2024-05-26 07:44:06] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-26 07:44:06] [INFO ] Invariant cache hit.
[2024-05-26 07:44:06] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-26 07:44:06] [INFO ] Redundant transitions in 9 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-26 07:44:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 20 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/254 places, 9/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 328 ms. Remains : 10/254 places, 9/203 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-09 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-26 07:44:06] [INFO ] Computed 102 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5328 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6646 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 12001ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 12002ms
[2024-05-26 07:44:18] [INFO ] Invariant cache hit.
[2024-05-26 07:44:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-26 07:44:18] [INFO ] Invariant cache hit.
[2024-05-26 07:44:18] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:44:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5355 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9299 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14697ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14698ms
Finished structural reductions in LTL mode , in 1 iterations and 26963 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-11 finished in 27050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)||X(G(p1)))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:44:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5399 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9271 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14694ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14695ms
[2024-05-26 07:44:48] [INFO ] Invariant cache hit.
[2024-05-26 07:44:48] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-26 07:44:48] [INFO ] Invariant cache hit.
[2024-05-26 07:44:48] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:44:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5597 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9206 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14822ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14823ms
Finished structural reductions in LTL mode , in 1 iterations and 29776 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-12
Product exploration explored 100000 steps with 3842 reset in 643 ms.
Product exploration explored 100000 steps with 11908 reset in 733 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40065 steps (8 resets) in 77 ms. (513 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
[2024-05-26 07:45:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/32 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 46/78 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/156 variables, 66/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 10/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 301/457 variables, 172/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 86/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 2 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/32 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 46/78 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 78/156 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 301/457 variables, 172/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 86/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/457 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 985ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2555 steps, including 0 resets, run visited all 2 properties in 58 ms. (steps per millisecond=44 )
Parikh walk visited 2 properties in 58 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:45:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5300 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9286 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14615ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14617ms
[2024-05-26 07:45:21] [INFO ] Invariant cache hit.
[2024-05-26 07:45:21] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-26 07:45:21] [INFO ] Invariant cache hit.
[2024-05-26 07:45:21] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:45:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5559 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9328 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14925ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14927ms
Finished structural reductions in LTL mode , in 1 iterations and 29808 ms. Remains : 254/254 places, 203/203 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40052 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
[2024-05-26 07:45:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/32 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 46/78 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/156 variables, 66/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 10/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 301/457 variables, 172/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 86/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 2 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/32 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 46/78 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 78/156 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 301/457 variables, 172/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 86/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/457 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2480 steps, including 0 resets, run visited all 2 properties in 26 ms. (steps per millisecond=95 )
Parikh walk visited 2 properties in 26 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3864 reset in 626 ms.
Product exploration explored 100000 steps with 17798 reset in 603 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 0 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 98 place count 156 transition count 106
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 98 rules in 8 ms. Remains 156 /254 variables (removed 98) and now considering 106/203 (removed 97) transitions.
Running 103 sub problems to find dead transitions.
// Phase 1: matrix 106 rows 156 cols
[2024-05-26 07:45:40] [INFO ] Computed 53 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 2/156 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 4 (OVERLAPS) 105/261 variables, 156/209 constraints. Problems are: Problem set: 49 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/209 constraints. Problems are: Problem set: 49 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/261 variables, 0/209 constraints. Problems are: Problem set: 49 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/262 variables, and 209 constraints, problems are : Problem set: 49 solved, 54 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 49 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 49 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 49 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 51/156 variables, 51/53 constraints. Problems are: Problem set: 49 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/53 constraints. Problems are: Problem set: 49 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 105/261 variables, 156/209 constraints. Problems are: Problem set: 49 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 54/263 constraints. Problems are: Problem set: 49 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/263 constraints. Problems are: Problem set: 49 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/261 variables, 0/263 constraints. Problems are: Problem set: 49 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/262 variables, and 263 constraints, problems are : Problem set: 49 solved, 54 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 54/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 3074ms problems are : Problem set: 49 solved, 54 unsolved
Search for dead transitions found 49 dead transitions in 3075ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 49 transitions.
[2024-05-26 07:45:43] [INFO ] Redundant transitions in 9 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 156/254 places, 57/203 transitions.
Graph (complete) has 213 edges and 156 vertex of which 107 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.4 ms
Discarding 49 places :
Also discarding 0 output transitions
Reduce places removed 49 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 58 transition count 57
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 46 place count 58 transition count 57
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 58 transition count 57
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 92 place count 14 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 136 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 14 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 13 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 13 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 139 rules in 12 ms. Remains 13 /156 variables (removed 143) and now considering 12/57 (removed 45) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/254 places, 12/203 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3115 ms. Remains : 13/254 places, 12/203 transitions.
Built C files in :
/tmp/ltsmin8997159573428593986
[2024-05-26 07:45:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8997159573428593986
Running compilation step : cd /tmp/ltsmin8997159573428593986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 358 ms.
Running link step : cd /tmp/ltsmin8997159573428593986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8997159573428593986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14378807300410353337.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-26 07:45:58] [INFO ] Computed 102 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5460 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7079 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 12572ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 12576ms
[2024-05-26 07:46:10] [INFO ] Invariant cache hit.
[2024-05-26 07:46:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-26 07:46:10] [INFO ] Invariant cache hit.
[2024-05-26 07:46:11] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:46:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5612 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9516 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 15148ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 15151ms
Finished structural reductions in LTL mode , in 1 iterations and 27976 ms. Remains : 254/254 places, 203/203 transitions.
Built C files in :
/tmp/ltsmin16968578863803620305
[2024-05-26 07:46:26] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16968578863803620305
Running compilation step : cd /tmp/ltsmin16968578863803620305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 366 ms.
Running link step : cd /tmp/ltsmin16968578863803620305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16968578863803620305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased452481613144589180.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 07:46:41] [INFO ] Flatten gal took : 9 ms
[2024-05-26 07:46:41] [INFO ] Flatten gal took : 7 ms
[2024-05-26 07:46:41] [INFO ] Time to serialize gal into /tmp/LTL7337055833406470565.gal : 2 ms
[2024-05-26 07:46:41] [INFO ] Time to serialize properties into /tmp/LTL9146896247855852234.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7337055833406470565.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12980704309473592470.hoa' '-atoms' '/tmp/LTL9146896247855852234.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9146896247855852234.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12980704309473592470.hoa
Detected timeout of ITS tools.
[2024-05-26 07:46:56] [INFO ] Flatten gal took : 22 ms
[2024-05-26 07:46:56] [INFO ] Flatten gal took : 7 ms
[2024-05-26 07:46:56] [INFO ] Time to serialize gal into /tmp/LTL6338286070432373910.gal : 21 ms
[2024-05-26 07:46:56] [INFO ] Time to serialize properties into /tmp/LTL12325333415137190103.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6338286070432373910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12325333415137190103.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(p55<2)"))||(X(G("(p73>pterce)"))))))))
Formula 0 simplified : XXX(G!"(p55<2)" & XF!"(p73>pterce)")
Detected timeout of ITS tools.
[2024-05-26 07:47:11] [INFO ] Flatten gal took : 10 ms
[2024-05-26 07:47:11] [INFO ] Applying decomposition
[2024-05-26 07:47:11] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10952216965940838198.txt' '-o' '/tmp/graph10952216965940838198.bin' '-w' '/tmp/graph10952216965940838198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10952216965940838198.bin' '-l' '-1' '-v' '-w' '/tmp/graph10952216965940838198.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:47:11] [INFO ] Decomposing Gal with order
[2024-05-26 07:47:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:47:11] [INFO ] Flatten gal took : 26 ms
[2024-05-26 07:47:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 07:47:11] [INFO ] Time to serialize gal into /tmp/LTL1597165030388615793.gal : 7 ms
[2024-05-26 07:47:11] [INFO ] Time to serialize properties into /tmp/LTL3004331330366846327.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1597165030388615793.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3004331330366846327.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(gi2.gu28.p55<2)"))||(X(G("(gu2.p73>gu2.pterce)"))))))))
Formula 0 simplified : XXX(G!"(gi2.gu28.p55<2)" & XF!"(gu2.p73>gu2.pterce)")
Detected timeout of ITS tools.
Treatment of property RefineWMG-PT-050050-LTLCardinality-12 finished in 173305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 6 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:47:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5502 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9479 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 15020ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 15025ms
[2024-05-26 07:47:41] [INFO ] Invariant cache hit.
[2024-05-26 07:47:41] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-26 07:47:41] [INFO ] Invariant cache hit.
[2024-05-26 07:47:42] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:47:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5466 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9365 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14870ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14871ms
Finished structural reductions in LTL mode , in 1 iterations and 30166 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-13
Product exploration explored 100000 steps with 253 reset in 656 ms.
Stack based approach found an accepted trace after 50 steps with 2 reset with depth 9 and stack size 9 in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-13 finished in 31032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:47:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5502 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9471 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 14993ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 14996ms
[2024-05-26 07:48:12] [INFO ] Invariant cache hit.
[2024-05-26 07:48:12] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-26 07:48:12] [INFO ] Invariant cache hit.
[2024-05-26 07:48:13] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-26 07:48:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5599 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 203/457 variables, 254/356 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 152/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 508 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9651 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 15273ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 15275ms
Finished structural reductions in LTL mode , in 1 iterations and 30515 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 358 ms.
Product exploration explored 100000 steps with 33333 reset in 393 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050050-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050050-LTLCardinality-14 finished in 31392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(((p1 U (G(p1)||(p1&&G(p2)))) U (G(p1)||(!p0&&(p1 U (G(p1)||(p1&&G(p2))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)||X(G(p1)))))))'
[2024-05-26 07:48:29] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7409823313299364868
[2024-05-26 07:48:29] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2024-05-26 07:48:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:48:29] [INFO ] Applying decomposition
[2024-05-26 07:48:29] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2024-05-26 07:48:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:48:29] [INFO ] Flatten gal took : 6 ms
[2024-05-26 07:48:29] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1650133421612224610.txt' '-o' '/tmp/graph1650133421612224610.bin' '-w' '/tmp/graph1650133421612224610.weights'
[2024-05-26 07:48:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:48:29] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7409823313299364868
Running compilation step : cd /tmp/ltsmin7409823313299364868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1650133421612224610.bin' '-l' '-1' '-v' '-w' '/tmp/graph1650133421612224610.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:48:29] [INFO ] Decomposing Gal with order
[2024-05-26 07:48:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:48:29] [INFO ] Flatten gal took : 24 ms
[2024-05-26 07:48:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 07:48:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality16504431232258868432.gal : 18 ms
[2024-05-26 07:48:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality9858734736249728998.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16504431232258868432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9858734736249728998.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !(((F("(gu51.p106<=gu51.p124)"))U(X((("(gu68.p24>gu68.p141)")U((G("(gu68.p24>gu68.p141)"))||(("(gu68.p24>gu68.p141)")&&(G("(gu38.p81>g...354
Formula 0 simplified : G!"(gu51.p106<=gu51.p124)" R X((F!"(gu38.p81>gu38.psecond)" U !"(gu68.p24>gu68.p141)") R (F!"(gu68.p24>gu68.p141)" & (!"(gu51.p106>g...226
Compilation finished in 562 ms.
Running link step : cd /tmp/ltsmin7409823313299364868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7409823313299364868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) U X((((LTLAPp1==true) U ([]((LTLAPp1==true))||((LTLAPp1==true)&&[]((LTLAPp2==true))))) U ([]((LTLAPp1==true))||(!(LTLAPp0==true)&&((LTLAPp1==true) U ([]((LTLAPp1==true))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))))))' '--buchi-type=spotba'
LTSmin run took 17905 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7409823313299364868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp3==true))||X([]((LTLAPp4==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: LTL layer: formula: X(X(X((<>((LTLAPp3==true))||X([]((LTLAPp4==true)))))))
pins2lts-mc-linux64( 6/ 8), 0.004: "X(X(X((<>((LTLAPp3==true))||X([]((LTLAPp4==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.077: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.106: DFS-FIFO for weak LTL, using special progress label 209
pins2lts-mc-linux64( 0/ 8), 0.106: There are 210 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.106: State length is 255, there are 210 groups
pins2lts-mc-linux64( 0/ 8), 0.106: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.106: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.106: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.106: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.776: ~1 levels ~960 states ~1696 transitions
pins2lts-mc-linux64( 2/ 8), 0.986: ~1 levels ~1920 states ~6328 transitions
pins2lts-mc-linux64( 2/ 8), 1.005: ~1 levels ~3840 states ~6328 transitions
pins2lts-mc-linux64( 5/ 8), 1.136: ~1 levels ~7680 states ~37672 transitions
pins2lts-mc-linux64( 5/ 8), 1.160: ~1 levels ~15360 states ~37672 transitions
pins2lts-mc-linux64( 5/ 8), 1.655: ~1 levels ~30720 states ~93584 transitions
pins2lts-mc-linux64( 5/ 8), 7.437: ~1 levels ~61440 states ~1187200 transitions
pins2lts-mc-linux64( 5/ 8), 11.985: ~1 levels ~122880 states ~4404648 transitions
pins2lts-mc-linux64( 2/ 8), 15.573: ~1 levels ~245760 states ~10818440 transitions
pins2lts-mc-linux64( 1/ 8), 22.362: ~1 levels ~491520 states ~23326368 transitions
pins2lts-mc-linux64( 1/ 8), 36.453: ~1 levels ~983040 states ~48813864 transitions
pins2lts-mc-linux64( 2/ 8), 64.475: ~1 levels ~1966080 states ~96184304 transitions
pins2lts-mc-linux64( 2/ 8), 128.263: ~1 levels ~3932160 states ~188212320 transitions
pins2lts-mc-linux64( 2/ 8), 277.888: ~1 levels ~7864320 states ~389038736 transitions
pins2lts-mc-linux64( 0/ 8), 430.027: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 430.205:
pins2lts-mc-linux64( 0/ 8), 430.205: mean standard work distribution: 1.3% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 430.205:
pins2lts-mc-linux64( 0/ 8), 430.205: Explored 10997320 states 559892365 transitions, fanout: 50.912
pins2lts-mc-linux64( 0/ 8), 430.205: Total exploration time 430.050 sec (429.920 sec minimum, 429.985 sec on average)
pins2lts-mc-linux64( 0/ 8), 430.205: States per second: 25572, Transitions per second: 1301924
pins2lts-mc-linux64( 0/ 8), 430.205:
pins2lts-mc-linux64( 0/ 8), 430.205: Progress states detected: 134217144
pins2lts-mc-linux64( 0/ 8), 430.205: Redundant explorations: -91.8063
pins2lts-mc-linux64( 0/ 8), 430.205:
pins2lts-mc-linux64( 0/ 8), 430.205: Queue width: 8B, total height: 165006174, memory: 1258.90MB
pins2lts-mc-linux64( 0/ 8), 430.205: Tree memory: 1060.7MB, 8.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 430.205: Tree fill ratio (roots/leafs): 99.0%/14.0%
pins2lts-mc-linux64( 0/ 8), 430.205: Stored 204 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 430.205: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 430.205: Est. total memory use: 2319.6MB (~2282.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7409823313299364868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp3==true))||X([]((LTLAPp4==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7409823313299364868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp3==true))||X([]((LTLAPp4==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-26 08:11:44] [INFO ] Flatten gal took : 19 ms
[2024-05-26 08:11:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality14390979218877688085.gal : 2 ms
[2024-05-26 08:11:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality687132107446820072.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14390979218877688085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality687132107446820072.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(p55<2)"))||(X(G("(p73>pterce)"))))))))
Formula 0 simplified : XXX(G!"(p55<2)" & XF!"(p73>pterce)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-26 08:35:00] [INFO ] Flatten gal took : 8 ms
[2024-05-26 08:35:00] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-26 08:35:00] [INFO ] Transformed 254 places.
[2024-05-26 08:35:00] [INFO ] Transformed 203 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 08:35:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality7511346173734342836.gal : 4 ms
[2024-05-26 08:35:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality7639726182573664420.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7511346173734342836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7639726182573664420.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X((F("(p55<2)"))||(X(G("(p73>pterce)"))))))))
Formula 0 simplified : XXX(G!"(p55<2)" & XF!"(p73>pterce)")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="RefineWMG-PT-050050"
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-5568"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-050050, 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 r312-tall-171662339200739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050050.tgz
mv RefineWMG-PT-050050 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;