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.r092-tall-171624189700628.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 DES-PT-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189700628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 08:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 08:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 08:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 68K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716336120141

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 00:02:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:02:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:02:01] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-22 00:02:01] [INFO ] Transformed 284 places.
[2024-05-22 00:02:01] [INFO ] Transformed 235 transitions.
[2024-05-22 00:02:01] [INFO ] Found NUPN structural information;
[2024-05-22 00:02:01] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-01b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 260 transition count 214
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 260 transition count 214
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 249 transition count 203
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 249 transition count 203
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 75 place count 249 transition count 195
Applied a total of 75 rules in 77 ms. Remains 249 /284 variables (removed 35) and now considering 195/235 (removed 40) transitions.
// Phase 1: matrix 195 rows 249 cols
[2024-05-22 00:02:01] [INFO ] Computed 62 invariants in 24 ms
[2024-05-22 00:02:02] [INFO ] Implicit Places using invariants in 309 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 337 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/284 places, 195/235 transitions.
Applied a total of 0 rules in 7 ms. Remains 247 /247 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 450 ms. Remains : 247/284 places, 195/235 transitions.
Support contains 30 out of 247 places after structural reductions.
[2024-05-22 00:02:02] [INFO ] Flatten gal took : 37 ms
[2024-05-22 00:02:02] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:02:02] [INFO ] Input system was already deterministic with 195 transitions.
RANDOM walk for 40000 steps (386 resets) in 1143 ms. (34 steps per ms) remains 0/25 properties
FORMULA DES-PT-01b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-01b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 53 stabilizing places and 49 stable transitions
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.13 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(G(p0))||G((F(p1) U X(p2)))))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 239 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 236 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 236 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 236 transition count 178
Applied a total of 28 rules in 27 ms. Remains 236 /247 variables (removed 11) and now considering 178/195 (removed 17) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-22 00:02:03] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 00:02:03] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 00:02:03] [INFO ] Invariant cache hit.
[2024-05-22 00:02:03] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-22 00:02:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 17 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 10 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:07] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 34 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:02:08] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:10] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:02:10] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:02:10] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:02:10] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/414 variables, 236/332 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:13] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:02:13] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:02:13] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:14] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:02:14] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:02:15] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:02:15] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:02:15] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:02:15] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:16] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-22 00:02:16] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:02:16] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:02:17] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:02:17] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 346 constraints, problems are : Problem set: 0 solved, 177 unsolved in 17625 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:02:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/414 variables, 236/350 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 177/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 527 constraints, problems are : Problem set: 0 solved, 177 unsolved in 27159 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 54/54 constraints]
After SMT, in 44853ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 44864ms
Starting structural reductions in LTL mode, iteration 1 : 236/247 places, 178/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45252 ms. Remains : 236/247 places, 178/195 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-01b-LTLFireability-00
Product exploration explored 100000 steps with 1141 reset in 345 ms.
Product exploration explored 100000 steps with 1143 reset in 219 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Detected a total of 51/236 stabilizing places and 47/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (421 resets) in 273 ms. (145 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (65 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
[2024-05-22 00:02:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/162 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/212 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/220 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 165/385 variables, 220/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/404 variables, 11/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/410 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/412 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/414 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/414 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/414 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf7 is UNSAT
After SMT solving in domain Int declared 16/414 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 2/33 constraints, Generalized P Invariants (flows): 0/27 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (AND (NOT p2) p0))), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 401 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 178/178 transitions.
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 230 transition count 158
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 214 transition count 158
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 33 place count 214 transition count 145
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 201 transition count 145
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 203 place count 129 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 127 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 125 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 211 place count 123 transition count 73
Applied a total of 211 rules in 56 ms. Remains 123 /236 variables (removed 113) and now considering 73/178 (removed 105) transitions.
// Phase 1: matrix 73 rows 123 cols
[2024-05-22 00:02:50] [INFO ] Computed 56 invariants in 1 ms
[2024-05-22 00:02:50] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 00:02:50] [INFO ] Invariant cache hit.
[2024-05-22 00:02:50] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [7, 31, 35, 40, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 118]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 284 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/236 places, 73/178 transitions.
Graph (complete) has 237 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 98 transition count 61
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 89 transition count 61
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 53 place count 65 transition count 51
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 0 with 2 rules applied. Total rules applied 55 place count 64 transition count 50
Applied a total of 55 rules in 10 ms. Remains 64 /102 variables (removed 38) and now considering 50/73 (removed 23) transitions.
// Phase 1: matrix 50 rows 64 cols
[2024-05-22 00:02:50] [INFO ] Computed 20 invariants in 2 ms
[2024-05-22 00:02:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 00:02:51] [INFO ] Invariant cache hit.
[2024-05-22 00:02:51] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/236 places, 50/178 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 49
Applied a total of 2 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 49/50 (removed 1) transitions.
// Phase 1: matrix 49 rows 62 cols
[2024-05-22 00:02:51] [INFO ] Computed 19 invariants in 0 ms
[2024-05-22 00:02:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 00:02:51] [INFO ] Invariant cache hit.
[2024-05-22 00:02:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:02:51] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 62/236 places, 49/178 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 574 ms. Remains : 62/236 places, 49/178 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Detected a total of 10/62 stabilizing places and 9/49 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 6 factoid took 371 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 70 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 458 steps (36 resets) in 10 ms. (41 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 6 factoid took 489 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 70 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 8465 reset in 169 ms.
Product exploration explored 100000 steps with 8503 reset in 258 ms.
Built C files in :
/tmp/ltsmin8531410945583082774
[2024-05-22 00:02:52] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2024-05-22 00:02:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:02:52] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2024-05-22 00:02:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:02:52] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2024-05-22 00:02:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:02:52] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8531410945583082774
Running compilation step : cd /tmp/ltsmin8531410945583082774;'/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 299 ms.
Running link step : cd /tmp/ltsmin8531410945583082774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8531410945583082774;'/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/stateBased14322159588739932670.hoa' '--buchi-type=spotba'
LTSmin run took 300 ms.
FORMULA DES-PT-01b-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-00 finished in 50509 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(F(p0)))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 239 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 236 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 236 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 236 transition count 178
Applied a total of 28 rules in 8 ms. Remains 236 /247 variables (removed 11) and now considering 178/195 (removed 17) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-22 00:02:53] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:02:53] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-22 00:02:53] [INFO ] Invariant cache hit.
[2024-05-22 00:02:53] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-22 00:02:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:02:56] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:02:58] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/414 variables, 236/332 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:03] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:03:03] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:03:03] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:04] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:03:05] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:03:05] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:03:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:03:05] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:03:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:03:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:03:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 346 constraints, problems are : Problem set: 0 solved, 177 unsolved in 17514 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:12] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:03:12] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:03:12] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:03:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/414 variables, 236/350 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 177/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 527 constraints, problems are : Problem set: 0 solved, 177 unsolved in 27333 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 54/54 constraints]
After SMT, in 44870ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 44873ms
Starting structural reductions in LTL mode, iteration 1 : 236/247 places, 178/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45153 ms. Remains : 236/247 places, 178/195 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-01b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLFireability-02 finished in 45419 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 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 241 transition count 173
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 223 transition count 173
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 223 transition count 160
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 210 transition count 160
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 205 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 205 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 205 transition count 151
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 204 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 204 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 203 transition count 149
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 201 transition count 147
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 201 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 201 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 87 place count 201 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 89 place count 200 transition count 144
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 233 place count 128 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 239 place count 125 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 123 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 122 transition count 78
Applied a total of 242 rules in 43 ms. Remains 122 /247 variables (removed 125) and now considering 78/195 (removed 117) transitions.
// Phase 1: matrix 78 rows 122 cols
[2024-05-22 00:03:39] [INFO ] Computed 57 invariants in 1 ms
[2024-05-22 00:03:39] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 00:03:39] [INFO ] Invariant cache hit.
[2024-05-22 00:03:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:03:39] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [7, 31, 35, 39, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96, 117]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 279 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/247 places, 78/195 transitions.
Graph (complete) has 263 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 100 transition count 67
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 90 transition count 67
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 53 place count 67 transition count 56
Applied a total of 53 rules in 11 ms. Remains 67 /104 variables (removed 37) and now considering 56/78 (removed 22) transitions.
// Phase 1: matrix 56 rows 67 cols
[2024-05-22 00:03:39] [INFO ] Computed 24 invariants in 0 ms
[2024-05-22 00:03:39] [INFO ] Implicit Places using invariants in 45 ms returned [37, 41, 44, 47, 53, 56]
[2024-05-22 00:03:39] [INFO ] Actually due to overlaps returned [37, 44, 47, 53, 56]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 50 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/247 places, 56/195 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 60 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 60 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 58 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 57 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 57 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 55 transition count 49
Applied a total of 13 rules in 7 ms. Remains 55 /62 variables (removed 7) and now considering 49/56 (removed 7) transitions.
// Phase 1: matrix 49 rows 55 cols
[2024-05-22 00:03:39] [INFO ] Computed 18 invariants in 1 ms
[2024-05-22 00:03:39] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 00:03:39] [INFO ] Invariant cache hit.
[2024-05-22 00:03:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:03:39] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 55/247 places, 49/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 591 ms. Remains : 55/247 places, 49/195 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-03
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-03 finished in 703 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(F(p0)))'
Support contains 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 239 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 236 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 236 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 236 transition count 178
Applied a total of 28 rules in 9 ms. Remains 236 /247 variables (removed 11) and now considering 178/195 (removed 17) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-22 00:03:39] [INFO ] Computed 60 invariants in 1 ms
[2024-05-22 00:03:39] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-22 00:03:39] [INFO ] Invariant cache hit.
[2024-05-22 00:03:40] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-22 00:03:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 2 ms to minimize.
[2024-05-22 00:03:46] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/414 variables, 236/332 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:03:49] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:03:52] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:03:53] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:03:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:03:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 346 constraints, problems are : Problem set: 0 solved, 177 unsolved in 17344 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/414 variables, 236/350 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 177/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 527 constraints, problems are : Problem set: 0 solved, 177 unsolved in 27299 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 54/54 constraints]
After SMT, in 44666ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 44668ms
Starting structural reductions in LTL mode, iteration 1 : 236/247 places, 178/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45028 ms. Remains : 236/247 places, 178/195 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-04
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA DES-PT-01b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-04 finished in 45100 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)&&F(G(p1)))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 241 transition count 176
Reduce places removed 15 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 226 transition count 173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 223 transition count 173
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 37 place count 223 transition count 161
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 61 place count 211 transition count 161
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 66 place count 206 transition count 156
Iterating global reduction 3 with 5 rules applied. Total rules applied 71 place count 206 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 75 place count 206 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 205 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 77 place count 205 transition count 150
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 204 transition count 150
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 81 place count 202 transition count 148
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 202 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 85 place count 202 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 85 place count 202 transition count 145
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 87 place count 201 transition count 145
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 146 rules applied. Total rules applied 233 place count 128 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 237 place count 126 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 239 place count 124 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 240 place count 123 transition count 72
Applied a total of 240 rules in 36 ms. Remains 123 /247 variables (removed 124) and now considering 72/195 (removed 123) transitions.
// Phase 1: matrix 72 rows 123 cols
[2024-05-22 00:04:24] [INFO ] Computed 57 invariants in 1 ms
[2024-05-22 00:04:24] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 00:04:24] [INFO ] Invariant cache hit.
[2024-05-22 00:04:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 00:04:24] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [7, 32, 36, 40, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96, 118]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 185 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/247 places, 72/195 transitions.
Graph (complete) has 247 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 97 transition count 59
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 87 transition count 59
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 61 transition count 47
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 59 transition count 46
Applied a total of 62 rules in 6 ms. Remains 59 /101 variables (removed 42) and now considering 46/72 (removed 26) transitions.
// Phase 1: matrix 46 rows 59 cols
[2024-05-22 00:04:24] [INFO ] Computed 19 invariants in 0 ms
[2024-05-22 00:04:25] [INFO ] Implicit Places using invariants in 43 ms returned [44, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/247 places, 46/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 55 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 55 transition count 43
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 0 with 2 rules applied. Total rules applied 6 place count 54 transition count 42
Applied a total of 6 rules in 4 ms. Remains 54 /57 variables (removed 3) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 54 cols
[2024-05-22 00:04:25] [INFO ] Computed 17 invariants in 1 ms
[2024-05-22 00:04:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 00:04:25] [INFO ] Invariant cache hit.
[2024-05-22 00:04:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 00:04:25] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 54/247 places, 42/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 393 ms. Remains : 54/247 places, 42/195 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-05
Product exploration explored 100000 steps with 10809 reset in 211 ms.
Product exploration explored 100000 steps with 10755 reset in 184 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 55 steps (4 resets) in 6 ms. (7 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-22 00:04:26] [INFO ] Invariant cache hit.
[2024-05-22 00:04:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 00:04:26] [INFO ] Invariant cache hit.
[2024-05-22 00:04:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 00:04:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-22 00:04:26] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-22 00:04:26] [INFO ] Invariant cache hit.
[2024-05-22 00:04:26] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 42/96 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 75 constraints, problems are : Problem set: 0 solved, 38 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 42/96 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 38/113 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 38 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1123ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1241 ms. Remains : 54/54 places, 42/42 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 44 steps (2 resets) in 4 ms. (8 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 10773 reset in 125 ms.
Product exploration explored 100000 steps with 10752 reset in 135 ms.
Built C files in :
/tmp/ltsmin17324956056582891738
[2024-05-22 00:04:28] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2024-05-22 00:04:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:04:28] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2024-05-22 00:04:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:04:28] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2024-05-22 00:04:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:04:28] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17324956056582891738
Running compilation step : cd /tmp/ltsmin17324956056582891738;'/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 157 ms.
Running link step : cd /tmp/ltsmin17324956056582891738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17324956056582891738;'/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/stateBased9026704426618690951.hoa' '--buchi-type=spotba'
LTSmin run took 435 ms.
FORMULA DES-PT-01b-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-05 finished in 4531 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 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 241 transition count 173
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 223 transition count 173
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 223 transition count 160
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 210 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 206 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 206 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 206 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 73 place count 206 transition count 153
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 75 place count 205 transition count 153
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 203 transition count 151
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 203 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 203 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 81 place count 203 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 202 transition count 148
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 227 place count 130 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 127 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 241 place count 127 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 125 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 124 transition count 81
Applied a total of 244 rules in 25 ms. Remains 124 /247 variables (removed 123) and now considering 81/195 (removed 114) transitions.
// Phase 1: matrix 81 rows 124 cols
[2024-05-22 00:04:29] [INFO ] Computed 57 invariants in 1 ms
[2024-05-22 00:04:29] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 00:04:29] [INFO ] Invariant cache hit.
[2024-05-22 00:04:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:04:29] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [7, 38, 42, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 98, 119]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 241 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/247 places, 81/195 transitions.
Graph (complete) has 255 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 99 transition count 68
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 89 transition count 68
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 57 place count 64 transition count 57
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 62 transition count 56
Applied a total of 60 rules in 5 ms. Remains 62 /103 variables (removed 41) and now considering 56/81 (removed 25) transitions.
// Phase 1: matrix 56 rows 62 cols
[2024-05-22 00:04:29] [INFO ] Computed 20 invariants in 1 ms
[2024-05-22 00:04:29] [INFO ] Implicit Places using invariants in 45 ms returned [48, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/247 places, 56/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 53
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 0 with 2 rules applied. Total rules applied 6 place count 57 transition count 52
Applied a total of 6 rules in 3 ms. Remains 57 /60 variables (removed 3) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 57 cols
[2024-05-22 00:04:29] [INFO ] Computed 18 invariants in 1 ms
[2024-05-22 00:04:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 00:04:29] [INFO ] Invariant cache hit.
[2024-05-22 00:04:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:04:29] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 57/247 places, 52/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 425 ms. Remains : 57/247 places, 52/195 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-06
Product exploration explored 100000 steps with 9902 reset in 142 ms.
Product exploration explored 100000 steps with 9893 reset in 157 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 272 steps (27 resets) in 5 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-22 00:04:30] [INFO ] Invariant cache hit.
[2024-05-22 00:04:30] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 00:04:30] [INFO ] Invariant cache hit.
[2024-05-22 00:04:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:04:30] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-22 00:04:30] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-22 00:04:30] [INFO ] Invariant cache hit.
[2024-05-22 00:04:30] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 52/109 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 83 constraints, problems are : Problem set: 0 solved, 43 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 52/109 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 43/126 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 126 constraints, problems are : Problem set: 0 solved, 43 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1515ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1516ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1637 ms. Remains : 57/57 places, 52/52 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 78 steps (5 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9892 reset in 141 ms.
Product exploration explored 100000 steps with 9906 reset in 149 ms.
Built C files in :
/tmp/ltsmin1324997661261022914
[2024-05-22 00:04:33] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-22 00:04:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:04:33] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-22 00:04:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:04:33] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-22 00:04:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:04:33] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1324997661261022914
Running compilation step : cd /tmp/ltsmin1324997661261022914;'/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 166 ms.
Running link step : cd /tmp/ltsmin1324997661261022914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1324997661261022914;'/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/stateBased17263755825877315477.hoa' '--buchi-type=spotba'
LTSmin run took 2187 ms.
FORMULA DES-PT-01b-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-06 finished in 6134 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(p0))||F(p1))&&(!p0||X((X(G(p2)) U (!p0&&X(G(p2)))))))))'
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 188
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 240 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 237 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 237 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 237 transition count 179
Applied a total of 26 rules in 5 ms. Remains 237 /247 variables (removed 10) and now considering 179/195 (removed 16) transitions.
// Phase 1: matrix 179 rows 237 cols
[2024-05-22 00:04:35] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:04:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 00:04:35] [INFO ] Invariant cache hit.
[2024-05-22 00:04:35] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-22 00:04:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 14/94 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 179/416 variables, 237/331 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 16/347 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (OVERLAPS) 0/416 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 356 constraints, problems are : Problem set: 0 solved, 178 unsolved in 15965 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 179/416 variables, 237/358 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 178/536 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 540 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 65/65 constraints]
After SMT, in 45996ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 45998ms
Starting structural reductions in LTL mode, iteration 1 : 237/247 places, 179/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46255 ms. Remains : 237/247 places, 179/195 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-07
Product exploration explored 100000 steps with 8915 reset in 89 ms.
Product exploration explored 100000 steps with 8960 reset in 93 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 417 edges and 237 vertex of which 232 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Detected a total of 52/237 stabilizing places and 48/179 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 149 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 93 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 231 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-22 00:05:23] [INFO ] Invariant cache hit.
[2024-05-22 00:05:23] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 00:05:23] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-22 00:05:23] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2024-05-22 00:05:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:05:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 00:05:23] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-22 00:05:23] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-22 00:05:23] [INFO ] Computed and/alt/rep : 177/290/177 causal constraints (skipped 1 transitions) in 12 ms.
[2024-05-22 00:05:24] [INFO ] Added : 115 causal constraints over 23 iterations in 586 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 237 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 179/179 transitions.
Applied a total of 0 rules in 1 ms. Remains 237 /237 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-22 00:05:24] [INFO ] Invariant cache hit.
[2024-05-22 00:05:24] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-22 00:05:24] [INFO ] Invariant cache hit.
[2024-05-22 00:05:24] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-22 00:05:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 14/94 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 179/416 variables, 237/331 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 16/347 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:05:36] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (OVERLAPS) 0/416 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 356 constraints, problems are : Problem set: 0 solved, 178 unsolved in 16309 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 179/416 variables, 237/358 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 178/536 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:05:44] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:05:45] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:05:45] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:05:45] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 540 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 65/65 constraints]
After SMT, in 46343ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 46346ms
Finished structural reductions in LTL mode , in 1 iterations and 46589 ms. Remains : 237/237 places, 179/179 transitions.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 417 edges and 237 vertex of which 232 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Detected a total of 52/237 stabilizing places and 48/179 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 82 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-22 00:06:11] [INFO ] Invariant cache hit.
[2024-05-22 00:06:12] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 00:06:12] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-22 00:06:12] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2024-05-22 00:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:06:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 00:06:12] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-22 00:06:12] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-22 00:06:12] [INFO ] Computed and/alt/rep : 177/290/177 causal constraints (skipped 1 transitions) in 13 ms.
[2024-05-22 00:06:13] [INFO ] Added : 115 causal constraints over 23 iterations in 540 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8948 reset in 88 ms.
Product exploration explored 100000 steps with 8917 reset in 107 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 179/179 transitions.
Graph (complete) has 417 edges and 237 vertex of which 232 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 232 transition count 176
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 17 place count 232 transition count 179
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 28 place count 232 transition count 179
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 226 transition count 173
Deduced a syphon composed of 21 places in 2 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 226 transition count 173
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 114 place count 226 transition count 176
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 122 place count 218 transition count 168
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 130 place count 218 transition count 168
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 135 place count 218 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 216 transition count 188
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 216 transition count 188
Deduced a syphon composed of 90 places in 0 ms
Applied a total of 139 rules in 36 ms. Remains 216 /237 variables (removed 21) and now considering 188/179 (removed -9) transitions.
[2024-05-22 00:06:14] [INFO ] Redundant transitions in 5 ms returned []
Running 187 sub problems to find dead transitions.
// Phase 1: matrix 188 rows 216 cols
[2024-05-22 00:06:14] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:06:14] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
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 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 TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 20/78 constraints. Problems are: Problem set: 66 solved, 121 unsolved
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 14/92 constraints. Problems are: Problem set: 99 solved, 88 unsolved
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 1/93 constraints. Problems are: Problem set: 99 solved, 88 unsolved
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/94 constraints. Problems are: Problem set: 99 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/94 constraints. Problems are: Problem set: 99 solved, 88 unsolved
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 TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
At refinement iteration 9 (OVERLAPS) 188/404 variables, 216/310 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 15/325 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 0/325 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/404 variables, 0/325 constraints. Problems are: Problem set: 117 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 325 constraints, problems are : Problem set: 117 solved, 70 unsolved in 7365 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 216/216 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 117 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 13/13 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 71/196 variables, 33/46 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 2/48 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 36/84 constraints. Problems are: Problem set: 117 solved, 70 unsolved
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/85 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/85 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 12/208 variables, 10/95 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/95 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 184/392 variables, 208/303 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 15/318 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 70/388 constraints. Problems are: Problem set: 117 solved, 70 unsolved
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 1/389 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/389 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 14 (OVERLAPS) 12/404 variables, 8/397 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 0/397 constraints. Problems are: Problem set: 117 solved, 70 unsolved
At refinement iteration 16 (OVERLAPS) 0/404 variables, 0/397 constraints. Problems are: Problem set: 117 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 397 constraints, problems are : Problem set: 117 solved, 70 unsolved in 10274 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 216/216 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 70/187 constraints, Known Traps: 38/38 constraints]
After SMT, in 17686ms problems are : Problem set: 117 solved, 70 unsolved
Search for dead transitions found 117 dead transitions in 17688ms
Found 117 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 117 transitions
Dead transitions reduction (with SMT) removed 117 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 216/237 places, 71/179 transitions.
Graph (complete) has 425 edges and 216 vertex of which 126 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 126 /216 variables (removed 90) and now considering 75/71 (removed -4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/237 places, 75/179 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17740 ms. Remains : 126/237 places, 75/179 transitions.
Built C files in :
/tmp/ltsmin15796563393290599712
[2024-05-22 00:06:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15796563393290599712
Running compilation step : cd /tmp/ltsmin15796563393290599712;'/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 333 ms.
Running link step : cd /tmp/ltsmin15796563393290599712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15796563393290599712;'/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/stateBased3457263956299500149.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 179/179 transitions.
Applied a total of 0 rules in 2 ms. Remains 237 /237 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 237 cols
[2024-05-22 00:06:46] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:06:47] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-22 00:06:47] [INFO ] Invariant cache hit.
[2024-05-22 00:06:47] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-22 00:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:06:50] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:06:51] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 14/94 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 179/416 variables, 237/331 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:06:53] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:06:54] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 16/347 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:06:55] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:06:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:06:56] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:06:56] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:06:58] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:06:59] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (OVERLAPS) 0/416 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 356 constraints, problems are : Problem set: 0 solved, 178 unsolved in 16187 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:07:04] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:07:05] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 179/416 variables, 237/358 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 178/536 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:07:07] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:07:07] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:07:07] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:07:07] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 1)
(s198 0)
(s199 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 540 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 65/65 constraints]
After SMT, in 46234ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 46236ms
Finished structural reductions in LTL mode , in 1 iterations and 46532 ms. Remains : 237/237 places, 179/179 transitions.
Built C files in :
/tmp/ltsmin11900695411255524387
[2024-05-22 00:07:33] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11900695411255524387
Running compilation step : cd /tmp/ltsmin11900695411255524387;'/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 323 ms.
Running link step : cd /tmp/ltsmin11900695411255524387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11900695411255524387;'/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/stateBased1827926663605622359.hoa' '--buchi-type=spotba'
LTSmin run took 11311 ms.
FORMULA DES-PT-01b-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-07 finished in 189708 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))) U ((p2||G(p3)) U X(p0))))'
Support contains 5 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 188
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 240 transition count 186
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 237 transition count 183
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 237 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 237 transition count 180
Applied a total of 25 rules in 13 ms. Remains 237 /247 variables (removed 10) and now considering 180/195 (removed 15) transitions.
// Phase 1: matrix 180 rows 237 cols
[2024-05-22 00:07:45] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:07:45] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 00:07:45] [INFO ] Invariant cache hit.
[2024-05-22 00:07:45] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-05-22 00:07:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:07:53] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 180/417 variables, 237/340 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 16 (OVERLAPS) 0/417 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 357 constraints, problems are : Problem set: 0 solved, 179 unsolved in 21251 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 60/120 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 180/417 variables, 237/357 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 179/536 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:08:18] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 539 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 63/63 constraints]
After SMT, in 51284ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 51287ms
Starting structural reductions in LTL mode, iteration 1 : 237/247 places, 180/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51569 ms. Remains : 237/247 places, 180/195 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DES-PT-01b-LTLFireability-08
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 2 ms.
FORMULA DES-PT-01b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-08 finished in 51902 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(F((p0||G(F(p1))))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 188
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 240 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 238 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 238 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 238 transition count 181
Applied a total of 23 rules in 9 ms. Remains 238 /247 variables (removed 9) and now considering 181/195 (removed 14) transitions.
// Phase 1: matrix 181 rows 238 cols
[2024-05-22 00:08:37] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:08:37] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 00:08:37] [INFO ] Invariant cache hit.
[2024-05-22 00:08:37] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-22 00:08:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:08:40] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 181/419 variables, 238/331 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:08:45] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:08:45] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:08:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:08:45] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:08:46] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 5/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (OVERLAPS) 0/419 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 349 constraints, problems are : Problem set: 0 solved, 180 unsolved in 18052 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:08:56] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:08:56] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 181/419 variables, 238/355 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 180/535 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 542 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 64/64 constraints]
After SMT, in 48086ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 48089ms
Starting structural reductions in LTL mode, iteration 1 : 238/247 places, 181/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48372 ms. Remains : 238/247 places, 181/195 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-01b-LTLFireability-09
Product exploration explored 100000 steps with 1094 reset in 165 ms.
Product exploration explored 100000 steps with 1108 reset in 191 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 421 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (422 resets) in 348 ms. (114 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (65 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
[2024-05-22 00:09:26] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 2/419 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/34 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 16ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 231 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 181/181 transitions.
Graph (complete) has 421 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 232 transition count 160
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 215 transition count 160
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 215 transition count 147
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 202 transition count 147
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 207 place count 129 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 127 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 125 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 215 place count 123 transition count 74
Applied a total of 215 rules in 19 ms. Remains 123 /238 variables (removed 115) and now considering 74/181 (removed 107) transitions.
// Phase 1: matrix 74 rows 123 cols
[2024-05-22 00:09:26] [INFO ] Computed 56 invariants in 1 ms
[2024-05-22 00:09:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 00:09:27] [INFO ] Invariant cache hit.
[2024-05-22 00:09:27] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [7, 36, 40, 61, 63, 65, 67, 69, 71, 73, 75, 97, 118]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 192 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/238 places, 74/181 transitions.
Graph (complete) has 261 edges and 110 vertex of which 108 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 106 transition count 62
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 25 rules applied. Total rules applied 26 place count 90 transition count 62
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 62 place count 65 transition count 51
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 63 transition count 50
Applied a total of 65 rules in 5 ms. Remains 63 /110 variables (removed 47) and now considering 50/74 (removed 24) transitions.
// Phase 1: matrix 50 rows 63 cols
[2024-05-22 00:09:27] [INFO ] Computed 20 invariants in 0 ms
[2024-05-22 00:09:27] [INFO ] Implicit Places using invariants in 45 ms returned [49, 52]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/238 places, 50/181 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 59 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 59 transition count 47
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 0 with 2 rules applied. Total rules applied 6 place count 58 transition count 46
Applied a total of 6 rules in 3 ms. Remains 58 /61 variables (removed 3) and now considering 46/50 (removed 4) transitions.
// Phase 1: matrix 46 rows 58 cols
[2024-05-22 00:09:27] [INFO ] Computed 18 invariants in 1 ms
[2024-05-22 00:09:27] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 00:09:27] [INFO ] Invariant cache hit.
[2024-05-22 00:09:27] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 58/238 places, 46/181 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 386 ms. Remains : 58/238 places, 46/181 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (4255 resets) in 140 ms. (283 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (833 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-05-22 00:09:27] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 2/104 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 11 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 12ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 166 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 10669 reset in 138 ms.
Product exploration explored 100000 steps with 10750 reset in 143 ms.
Built C files in :
/tmp/ltsmin9206267111603283789
[2024-05-22 00:09:28] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2024-05-22 00:09:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:09:28] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2024-05-22 00:09:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:09:28] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2024-05-22 00:09:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:09:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9206267111603283789
Running compilation step : cd /tmp/ltsmin9206267111603283789;'/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 148 ms.
Running link step : cd /tmp/ltsmin9206267111603283789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9206267111603283789;'/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/stateBased6093068899394977190.hoa' '--buchi-type=spotba'
LTSmin run took 1154 ms.
FORMULA DES-PT-01b-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-09 finished in 53157 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(G((p0||X(X(F(p1))))))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 241 transition count 189
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 241 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 241 transition count 187
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 238 transition count 184
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 238 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 238 transition count 181
Applied a total of 23 rules in 10 ms. Remains 238 /247 variables (removed 9) and now considering 181/195 (removed 14) transitions.
// Phase 1: matrix 181 rows 238 cols
[2024-05-22 00:09:30] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:09:30] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-22 00:09:30] [INFO ] Invariant cache hit.
[2024-05-22 00:09:30] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-22 00:09:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:32] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:09:32] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:09:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 181/419 variables, 238/332 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 12/344 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:09:42] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/419 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (OVERLAPS) 0/419 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 349 constraints, problems are : Problem set: 0 solved, 180 unsolved in 18601 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 181/419 variables, 238/351 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 180/531 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/419 variables, 5/538 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 538 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 60/60 constraints]
After SMT, in 48635ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 48639ms
Starting structural reductions in LTL mode, iteration 1 : 238/247 places, 181/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48934 ms. Remains : 238/247 places, 181/195 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-10
Product exploration explored 100000 steps with 1096 reset in 136 ms.
Product exploration explored 100000 steps with 1085 reset in 164 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Detected a total of 52/238 stabilizing places and 48/181 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 27575 steps (290 resets) in 66 ms. (411 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 181/181 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2024-05-22 00:10:20] [INFO ] Invariant cache hit.
[2024-05-22 00:10:20] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 00:10:20] [INFO ] Invariant cache hit.
[2024-05-22 00:10:20] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-22 00:10:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 181/419 variables, 238/332 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 12/344 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/419 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (OVERLAPS) 0/419 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 349 constraints, problems are : Problem set: 0 solved, 180 unsolved in 18842 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 181/419 variables, 238/351 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 180/531 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/419 variables, 5/538 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 538 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 60/60 constraints]
After SMT, in 48874ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 48876ms
Finished structural reductions in LTL mode , in 1 iterations and 49142 ms. Remains : 238/238 places, 181/181 transitions.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Detected a total of 52/238 stabilizing places and 48/181 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 38801 steps (407 resets) in 83 ms. (461 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1108 reset in 139 ms.
Product exploration explored 100000 steps with 1097 reset in 156 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 181/181 transitions.
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 233 transition count 178
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 19 place count 233 transition count 180
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 29 place count 233 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 226 transition count 173
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 226 transition count 173
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 115 place count 226 transition count 174
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 217 transition count 165
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 217 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 139 place count 217 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 215 transition count 183
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 215 transition count 183
Deduced a syphon composed of 88 places in 1 ms
Applied a total of 143 rules in 21 ms. Remains 215 /238 variables (removed 23) and now considering 183/181 (removed -2) transitions.
[2024-05-22 00:11:11] [INFO ] Redundant transitions in 4 ms returned []
Running 182 sub problems to find dead transitions.
// Phase 1: matrix 183 rows 215 cols
[2024-05-22 00:11:11] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:11:11] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
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 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 TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/78 constraints. Problems are: Problem set: 59 solved, 123 unsolved
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 12/90 constraints. Problems are: Problem set: 92 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/90 constraints. Problems are: Problem set: 92 solved, 90 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
At refinement iteration 7 (OVERLAPS) 183/398 variables, 215/305 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 9/314 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/314 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/398 variables, 0/314 constraints. Problems are: Problem set: 108 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 314 constraints, problems are : Problem set: 108 solved, 74 unsolved in 5457 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/215 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 108 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 13/13 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 71/197 variables, 33/46 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/48 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 32/80 constraints. Problems are: Problem set: 108 solved, 74 unsolved
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 2/82 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/82 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 11/208 variables, 10/92 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/92 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 179/387 variables, 208/300 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 9/309 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 74/383 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/383 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 11/398 variables, 7/390 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/390 constraints. Problems are: Problem set: 108 solved, 74 unsolved
At refinement iteration 15 (OVERLAPS) 0/398 variables, 0/390 constraints. Problems are: Problem set: 108 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 390 constraints, problems are : Problem set: 108 solved, 74 unsolved in 8374 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 215/215 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 74/182 constraints, Known Traps: 34/34 constraints]
After SMT, in 13867ms problems are : Problem set: 108 solved, 74 unsolved
Search for dead transitions found 108 dead transitions in 13871ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 215/238 places, 75/181 transitions.
Graph (complete) has 430 edges and 215 vertex of which 127 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.1 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 127 /215 variables (removed 88) and now considering 75/75 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 127/238 places, 75/181 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13922 ms. Remains : 127/238 places, 75/181 transitions.
Built C files in :
/tmp/ltsmin11505411156153682771
[2024-05-22 00:11:25] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11505411156153682771
Running compilation step : cd /tmp/ltsmin11505411156153682771;'/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 345 ms.
Running link step : cd /tmp/ltsmin11505411156153682771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11505411156153682771;'/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/stateBased6855102886113554453.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 181/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 238 cols
[2024-05-22 00:11:40] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:11:40] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 00:11:40] [INFO ] Invariant cache hit.
[2024-05-22 00:11:40] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-22 00:11:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 181/419 variables, 238/332 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 12/344 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:11:54] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/419 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (OVERLAPS) 0/419 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 349 constraints, problems are : Problem set: 0 solved, 180 unsolved in 18185 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 181/419 variables, 238/351 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 180/531 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:12:25] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:12:25] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/419 variables, 5/538 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 538 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 60/60 constraints]
After SMT, in 48216ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 48218ms
Finished structural reductions in LTL mode , in 1 iterations and 48485 ms. Remains : 238/238 places, 181/181 transitions.
Built C files in :
/tmp/ltsmin7206380284245583576
[2024-05-22 00:12:28] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7206380284245583576
Running compilation step : cd /tmp/ltsmin7206380284245583576;'/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 347 ms.
Running link step : cd /tmp/ltsmin7206380284245583576;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7206380284245583576;'/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/stateBased4061141268511367103.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:12:43] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:12:43] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:12:43] [INFO ] Time to serialize gal into /tmp/LTL15289739211900378275.gal : 3 ms
[2024-05-22 00:12:43] [INFO ] Time to serialize properties into /tmp/LTL7323929595946983513.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/LTL15289739211900378275.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12372161433535725215.hoa' '-atoms' '/tmp/LTL7323929595946983513.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...319
Loading property file /tmp/LTL7323929595946983513.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12372161433535725215.hoa
Detected timeout of ITS tools.
[2024-05-22 00:12:58] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:12:58] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:12:58] [INFO ] Time to serialize gal into /tmp/LTL13522410436976140491.gal : 2 ms
[2024-05-22 00:12:58] [INFO ] Time to serialize properties into /tmp/LTL3842153280055216009.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13522410436976140491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3842153280055216009.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(G(("(p249==0)")||(X(X(F("(((p25==0)||(p79==0))||(p249==0))")))))))))
Formula 0 simplified : XXF(!"(p249==0)" & XXG!"(((p25==0)||(p79==0))||(p249==0))")
Detected timeout of ITS tools.
[2024-05-22 00:13:13] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:13:13] [INFO ] Applying decomposition
[2024-05-22 00:13:13] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14481273071072311192.txt' '-o' '/tmp/graph14481273071072311192.bin' '-w' '/tmp/graph14481273071072311192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14481273071072311192.bin' '-l' '-1' '-v' '-w' '/tmp/graph14481273071072311192.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:13:14] [INFO ] Decomposing Gal with order
[2024-05-22 00:13:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:13:14] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 00:13:14] [INFO ] Flatten gal took : 40 ms
[2024-05-22 00:13:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2024-05-22 00:13:14] [INFO ] Time to serialize gal into /tmp/LTL10129443901483404289.gal : 5 ms
[2024-05-22 00:13:14] [INFO ] Time to serialize properties into /tmp/LTL2036240639137870502.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/LTL10129443901483404289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2036240639137870502.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i7.u64.p249==0)")||(X(X(F("(((i3.u6.p25==0)||(i3.u18.p79==0))||(i7.u64.p249==0))")))))))))
Formula 0 simplified : XXF(!"(i7.u64.p249==0)" & XXG!"(((i3.u6.p25==0)||(i3.u18.p79==0))||(i7.u64.p249==0))")
Reverse transition relation is NOT exact ! Due to transitions t0, t55, t90, t103, t128, t188, i0.t143, i0.u9.t121, i0.u74.t17, i1.u13.t115, i2.u7.t132, i2....707
Computing Next relation with stutter on 15407 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-01b-LTLFireability-10 finished in 238980 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((F(p0)&&(p0||G(p1)))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 241 transition count 189
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 241 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 241 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 239 transition count 184
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 239 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 239 transition count 182
Applied a total of 21 rules in 9 ms. Remains 239 /247 variables (removed 8) and now considering 182/195 (removed 13) transitions.
// Phase 1: matrix 182 rows 239 cols
[2024-05-22 00:13:29] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:13:29] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-22 00:13:29] [INFO ] Invariant cache hit.
[2024-05-22 00:13:29] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:13:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 5 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 182/421 variables, 239/336 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 5/341 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 12/353 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (OVERLAPS) 0/421 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 357 constraints, problems are : Problem set: 0 solved, 181 unsolved in 17993 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 58/118 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 182/421 variables, 239/360 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 181/541 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 4/545 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 546 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 66/66 constraints]
After SMT, in 48028ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 48030ms
Starting structural reductions in LTL mode, iteration 1 : 239/247 places, 182/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48322 ms. Remains : 239/247 places, 182/195 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 422 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 34 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-01b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLFireability-11 finished in 48811 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)&&F(G(p1)))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 241 transition count 174
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 224 transition count 174
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 224 transition count 161
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 211 transition count 161
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 206 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 206 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 206 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 205 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 205 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 204 transition count 150
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 202 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 202 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 85 place count 202 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 85 place count 202 transition count 145
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 201 transition count 145
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 231 place count 129 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 237 place count 126 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 239 place count 124 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 123 transition count 79
Applied a total of 240 rules in 50 ms. Remains 123 /247 variables (removed 124) and now considering 79/195 (removed 116) transitions.
// Phase 1: matrix 79 rows 123 cols
[2024-05-22 00:14:18] [INFO ] Computed 57 invariants in 2 ms
[2024-05-22 00:14:18] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 00:14:18] [INFO ] Invariant cache hit.
[2024-05-22 00:14:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:14:18] [INFO ] Implicit Places using invariants and state equation in 230 ms returned [7, 32, 36, 40, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 97, 118]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 340 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/247 places, 79/195 transitions.
Graph (complete) has 265 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 102 transition count 68
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 20 place count 91 transition count 68
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 54 place count 68 transition count 57
Applied a total of 54 rules in 4 ms. Remains 68 /106 variables (removed 38) and now considering 57/79 (removed 22) transitions.
// Phase 1: matrix 57 rows 68 cols
[2024-05-22 00:14:18] [INFO ] Computed 24 invariants in 1 ms
[2024-05-22 00:14:18] [INFO ] Implicit Places using invariants in 88 ms returned [38, 42, 45, 48, 54, 57]
[2024-05-22 00:14:18] [INFO ] Actually due to overlaps returned [38, 45, 48, 54, 57]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 88 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/247 places, 57/195 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 61 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 61 transition count 55
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 59 transition count 54
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 58 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 58 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 56 transition count 50
Applied a total of 13 rules in 5 ms. Remains 56 /63 variables (removed 7) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-05-22 00:14:18] [INFO ] Computed 18 invariants in 1 ms
[2024-05-22 00:14:18] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 00:14:18] [INFO ] Invariant cache hit.
[2024-05-22 00:14:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:14:18] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 56/247 places, 50/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 609 ms. Remains : 56/247 places, 50/195 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-12
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-12 finished in 763 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(F(p0))||(F(p0)&&(!p1||X(!p0))))))'
Support contains 1 out of 247 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 241 transition count 174
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 224 transition count 174
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 224 transition count 161
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 211 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 207 transition count 157
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 207 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 207 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 71 place count 207 transition count 154
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 73 place count 206 transition count 154
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 204 transition count 152
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 204 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 204 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 204 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 203 transition count 149
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 223 place count 132 transition count 78
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 229 place count 129 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 237 place count 129 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 127 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 126 transition count 83
Applied a total of 240 rules in 28 ms. Remains 126 /247 variables (removed 121) and now considering 83/195 (removed 112) transitions.
// Phase 1: matrix 83 rows 126 cols
[2024-05-22 00:14:18] [INFO ] Computed 57 invariants in 0 ms
[2024-05-22 00:14:18] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 00:14:18] [INFO ] Invariant cache hit.
[2024-05-22 00:14:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:14:19] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [7, 38, 42, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 98, 121]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 216 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/247 places, 83/195 transitions.
Graph (complete) has 255 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 101 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 91 transition count 70
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 57 place count 66 transition count 59
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 64 transition count 58
Applied a total of 60 rules in 5 ms. Remains 64 /105 variables (removed 41) and now considering 58/83 (removed 25) transitions.
// Phase 1: matrix 58 rows 64 cols
[2024-05-22 00:14:19] [INFO ] Computed 20 invariants in 0 ms
[2024-05-22 00:14:19] [INFO ] Implicit Places using invariants in 43 ms returned [50, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/247 places, 58/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 55
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 0 with 2 rules applied. Total rules applied 6 place count 59 transition count 54
Applied a total of 6 rules in 3 ms. Remains 59 /62 variables (removed 3) and now considering 54/58 (removed 4) transitions.
// Phase 1: matrix 54 rows 59 cols
[2024-05-22 00:14:19] [INFO ] Computed 18 invariants in 0 ms
[2024-05-22 00:14:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 00:14:19] [INFO ] Invariant cache hit.
[2024-05-22 00:14:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:14:19] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 59/247 places, 54/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 400 ms. Remains : 59/247 places, 54/195 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-13
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-13 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-13 finished in 461 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(G((p0||X(X(F(p1))))))))'
[2024-05-22 00:14:19] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9423457417441292805
[2024-05-22 00:14:19] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2024-05-22 00:14:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:14:19] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2024-05-22 00:14:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:14:19] [INFO ] Applying decomposition
[2024-05-22 00:14:19] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11412784123054204246.txt' '-o' '/tmp/graph11412784123054204246.bin' '-w' '/tmp/graph11412784123054204246.weights'
[2024-05-22 00:14:19] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2024-05-22 00:14:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11412784123054204246.bin' '-l' '-1' '-v' '-w' '/tmp/graph11412784123054204246.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:14:19] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9423457417441292805
Running compilation step : cd /tmp/ltsmin9423457417441292805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
[2024-05-22 00:14:19] [INFO ] Decomposing Gal with order
[2024-05-22 00:14:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:14:19] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-22 00:14:19] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:14:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 18 ms.
[2024-05-22 00:14:19] [INFO ] Time to serialize gal into /tmp/LTLFireability2001241473806504563.gal : 4 ms
[2024-05-22 00:14:19] [INFO ] Time to serialize properties into /tmp/LTLFireability9920815946992475609.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/LTLFireability2001241473806504563.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9920815946992475609.ltl' '-c' '-stutter-deadlock'

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(G(("(i12.u72.p249==0)")||(X(X(F("(((i5.u6.p25==0)||(i5.u23.p79==0))||(i12.u72.p249==0))")))))))))
Formula 0 simplified : XXF(!"(i12.u72.p249==0)" & XXG!"(((i5.u6.p25==0)||(i5.u23.p79==0))||(i12.u72.p249==0))")
Compilation finished in 476 ms.
Running link step : cd /tmp/ltsmin9423457417441292805;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9423457417441292805;'/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([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t90, t103, t128, t143, t188, i0.i0.u36.t80, i0.i2.u81.t17, i1.i0.u13.t118, i1.i0.u17...796
Computing Next relation with stutter on 42323 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: LTL layer: formula: X(X([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))))
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: "X(X([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.027: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.069: DFS-FIFO for weak LTL, using special progress label 198
pins2lts-mc-linux64( 0/ 8), 0.069: There are 199 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.069: State length is 248, there are 201 groups
pins2lts-mc-linux64( 0/ 8), 0.069: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.069: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.069: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.069: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.099: ~1 levels ~960 states ~4128 transitions
pins2lts-mc-linux64( 1/ 8), 0.120: ~1 levels ~1920 states ~8896 transitions
pins2lts-mc-linux64( 1/ 8), 0.149: ~1 levels ~3840 states ~18920 transitions
pins2lts-mc-linux64( 3/ 8), 0.204: ~1 levels ~7680 states ~40264 transitions
pins2lts-mc-linux64( 1/ 8), 0.332: ~1 levels ~15360 states ~88768 transitions
pins2lts-mc-linux64( 2/ 8), 0.552: ~1 levels ~30720 states ~204584 transitions
pins2lts-mc-linux64( 1/ 8), 0.931: ~1 levels ~61440 states ~414560 transitions
pins2lts-mc-linux64( 1/ 8), 1.668: ~1 levels ~122880 states ~856352 transitions
pins2lts-mc-linux64( 1/ 8), 2.916: ~1 levels ~245760 states ~1751200 transitions
pins2lts-mc-linux64( 1/ 8), 4.809: ~1 levels ~491520 states ~3588352 transitions
pins2lts-mc-linux64( 1/ 8), 7.772: ~1 levels ~983040 states ~7323664 transitions
pins2lts-mc-linux64( 1/ 8), 13.737: ~1 levels ~1966080 states ~15096864 transitions
pins2lts-mc-linux64( 1/ 8), 27.894: ~1 levels ~3932160 states ~34835312 transitions
pins2lts-mc-linux64( 4/ 8), 57.346: ~1 levels ~7864320 states ~74805880 transitions
pins2lts-mc-linux64( 4/ 8), 114.857: ~1 levels ~15728640 states ~155058752 transitions
pins2lts-mc-linux64( 4/ 8), 231.703: ~1 levels ~31457280 states ~318682368 transitions
pins2lts-mc-linux64( 4/ 8), 464.870: ~1 levels ~62914560 states ~648221312 transitions
pins2lts-mc-linux64( 3/ 8), 689.200: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 689.274:
pins2lts-mc-linux64( 0/ 8), 689.274: mean standard work distribution: 6.9% (states) 2.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 689.274:
pins2lts-mc-linux64( 0/ 8), 689.274: Explored 78590495 states 971285548 transitions, fanout: 12.359
pins2lts-mc-linux64( 0/ 8), 689.274: Total exploration time 689.190 sec (689.110 sec minimum, 689.148 sec on average)
pins2lts-mc-linux64( 0/ 8), 689.274: States per second: 114033, Transitions per second: 1409315
pins2lts-mc-linux64( 0/ 8), 689.274:
pins2lts-mc-linux64( 0/ 8), 689.274: Progress states detected: 134217351
pins2lts-mc-linux64( 0/ 8), 689.274: Redundant explorations: -41.4454
pins2lts-mc-linux64( 0/ 8), 689.274:
pins2lts-mc-linux64( 0/ 8), 689.274: Queue width: 8B, total height: 91469764, memory: 697.86MB
pins2lts-mc-linux64( 0/ 8), 689.274: Tree memory: 1097.3MB, 8.6 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 689.274: Tree fill ratio (roots/leafs): 99.0%/28.0%
pins2lts-mc-linux64( 0/ 8), 689.274: Stored 195 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 689.274: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 689.274: Est. total memory use: 1795.2MB (~1721.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9423457417441292805;'/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([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9423457417441292805;'/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([](((LTLAPp0==true)||X(X(<>((LTLAPp1==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)
551 unique states visited
0 strongly connected components in search stack
589 transitions explored
227 items max in DFS search stack
73582 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,735.865,2429888,1,0,2.88004e+06,1919,1979,2.23238e+07,225,12163,1211497
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-01b-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1864994 ms.

BK_STOP 1716337986301

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-01b"
export BK_EXAMINATION="LTLFireability"
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 DES-PT-01b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189700628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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