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.r268-smll-171654407100212.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 Peterson-COL-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407100212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.3K Apr 12 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716732598104

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-26 14:10:00] [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-26 14:10:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 14:10:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 14:10:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 14:10:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1319 ms
[2024-05-26 14:10:02] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 14:10:02] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-05-26 14:10:02] [INFO ] Skeletonized 15 HLPN properties in 3 ms. Removed 1 properties that had guard overlaps.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 4151 steps (0 resets) in 172 ms. (23 steps per ms) remains 0/15 properties
[2024-05-26 14:10:03] [INFO ] Flatten gal took : 30 ms
[2024-05-26 14:10:03] [INFO ] Flatten gal took : 6 ms
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 14:10:03] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 87 ms.
[2024-05-26 14:10:03] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 24 transitions.
Support contains 244 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 20 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:10:03] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 14:10:03] [INFO ] Computed 15 invariants in 40 ms
[2024-05-26 14:10:03] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-26 14:10:03] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:10:03] [INFO ] Invariant cache hit.
[2024-05-26 14:10:04] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 14:10:04] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 14:10:04] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:10:04] [INFO ] Invariant cache hit.
[2024-05-26 14:10:04] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:10:08] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 48 ms to minimize.
[2024-05-26 14:10:08] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
[2024-05-26 14:10:08] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-26 14:10:08] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2024-05-26 14:10:08] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-05-26 14:10:08] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 4 ms to minimize.
[2024-05-26 14:10:08] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 4 ms to minimize.
[2024-05-26 14:10:09] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 9 ms to minimize.
[2024-05-26 14:10:09] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2024-05-26 14:10:09] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 4 ms to minimize.
[2024-05-26 14:10:09] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 4 ms to minimize.
[2024-05-26 14:10:09] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 4 ms to minimize.
[2024-05-26 14:10:09] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 3 ms to minimize.
[2024-05-26 14:10:10] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-05-26 14:10:10] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 4 ms to minimize.
[2024-05-26 14:10:10] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 4 ms to minimize.
[2024-05-26 14:10:10] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-26 14:10:10] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-26 14:10:10] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-26 14:10:11] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:10:11] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 3 ms to minimize.
[2024-05-26 14:10:11] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-05-26 14:10:11] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 3 ms to minimize.
[2024-05-26 14:10:11] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-26 14:10:11] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-26 14:10:11] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-26 14:10:11] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-26 14:10:11] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-26 14:10:11] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-26 14:10:12] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-26 14:10:12] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-26 14:10:12] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-26 14:10:12] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-26 14:10:12] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 2 ms to minimize.
[2024-05-26 14:10:12] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 7 ms to minimize.
[2024-05-26 14:10:12] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 2 ms to minimize.
[2024-05-26 14:10:13] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-26 14:10:13] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2024-05-26 14:10:13] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2024-05-26 14:10:13] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:10:16] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
[2024-05-26 14:10:16] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-05-26 14:10:16] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-26 14:10:17] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-26 14:10:17] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-26 14:10:17] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-26 14:10:17] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-26 14:10:17] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
[2024-05-26 14:10:17] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 3 ms to minimize.
[2024-05-26 14:10:18] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 4 ms to minimize.
[2024-05-26 14:10:18] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-05-26 14:10:18] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 3 ms to minimize.
[2024-05-26 14:10:18] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
[2024-05-26 14:10:19] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 3 ms to minimize.
[2024-05-26 14:10:19] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-05-26 14:10:19] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-26 14:10:19] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 5 ms to minimize.
[2024-05-26 14:10:20] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 3 ms to minimize.
[2024-05-26 14:10:20] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-26 14:10:20] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:10:22] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
[2024-05-26 14:10:22] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 4 ms to minimize.
[2024-05-26 14:10:23] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 3 ms to minimize.
[2024-05-26 14:10:23] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 4 ms to minimize.
[2024-05-26 14:10:24] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 3 ms to minimize.
[2024-05-26 14:10:24] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-26 14:10:24] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 3 ms to minimize.
[2024-05-26 14:10:25] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 3 ms to minimize.
[2024-05-26 14:10:25] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 3 ms to minimize.
[2024-05-26 14:10:25] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 3 ms to minimize.
[2024-05-26 14:10:25] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-05-26 14:10:25] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-05-26 14:10:26] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-05-26 14:10:26] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-05-26 14:10:26] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 3 ms to minimize.
[2024-05-26 14:10:27] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-05-26 14:10:27] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-05-26 14:10:27] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-26 14:10:27] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:10:30] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-26 14:10:31] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 3 ms to minimize.
[2024-05-26 14:10:32] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 3 ms to minimize.
[2024-05-26 14:10:32] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 3 ms to minimize.
[2024-05-26 14:10:32] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 3 ms to minimize.
[2024-05-26 14:10:32] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 96 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:10:38] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-26 14:10:38] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 3 ms to minimize.
[2024-05-26 14:10:39] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 3 ms to minimize.
[2024-05-26 14:10:39] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 4 ms to minimize.
[2024-05-26 14:10:40] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-26 14:10:40] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:10:43] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-26 14:10:44] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 3 ms to minimize.
[2024-05-26 14:10:45] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 4 ms to minimize.
[2024-05-26 14:10:45] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:10:47] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 3 ms to minimize.
[2024-05-26 14:10:47] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:11:00] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 3 ms to minimize.
[2024-05-26 14:11:00] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 114 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 99/99 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60399ms
Finished structural reductions in LTL mode , in 1 iterations and 61166 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 244 out of 244 places after structural reductions.
[2024-05-26 14:11:04] [INFO ] Flatten gal took : 80 ms
[2024-05-26 14:11:04] [INFO ] Flatten gal took : 97 ms
[2024-05-26 14:11:05] [INFO ] Input system was already deterministic with 332 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (8 resets) in 1158 ms. (34 steps per ms) remains 2/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 2/2 properties
[2024-05-26 14:11:05] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:11:05] [INFO ] Invariant cache hit.
[2024-05-26 14:11:05] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/552 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/552 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 316 constraints, problems are : Problem set: 0 solved, 2 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/552 variables, 12/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:11:06] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-26 14:11:06] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-26 14:11:06] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-05-26 14:11:07] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 3 ms to minimize.
[2024-05-26 14:11:07] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-26 14:11:07] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-26 14:11:07] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-26 14:11:07] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-26 14:11:07] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-26 14:11:07] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-26 14:11:07] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-26 14:11:07] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 3 ms to minimize.
[2024-05-26 14:11:08] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 3 ms to minimize.
[2024-05-26 14:11:08] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-26 14:11:08] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 3 ms to minimize.
[2024-05-26 14:11:08] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 4 ms to minimize.
[2024-05-26 14:11:08] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-05-26 14:11:08] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 4 ms to minimize.
[2024-05-26 14:11:09] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
[2024-05-26 14:11:09] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 20/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:11:09] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 3 ms to minimize.
[2024-05-26 14:11:09] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-05-26 14:11:09] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 3 ms to minimize.
[2024-05-26 14:11:09] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-26 14:11:10] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-26 14:11:10] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 2 ms to minimize.
[2024-05-26 14:11:10] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2024-05-26 14:11:10] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 8/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:11:10] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-26 14:11:10] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-26 14:11:10] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-26 14:11:10] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 4 ms to minimize.
[2024-05-26 14:11:11] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 3 ms to minimize.
[2024-05-26 14:11:11] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2024-05-26 14:11:11] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-26 14:11:11] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 3 ms to minimize.
SMT process timed out in 5422ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 244 transition count 242
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 154 transition count 242
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 180 place count 154 transition count 195
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 274 place count 107 transition count 195
Applied a total of 274 rules in 44 ms. Remains 107 /244 variables (removed 137) and now considering 195/332 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 107/244 places, 195/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 639 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 108 steps, run visited all 2 properties in 10 ms. (steps per millisecond=10 )
Probabilistic random walk after 108 steps, saw 89 distinct states, run finished after 16 ms. (steps per millisecond=6 ) properties seen :2
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 188 place count 150 transition count 196
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 272 place count 108 transition count 196
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 280 place count 104 transition count 192
Applied a total of 280 rules in 76 ms. Remains 104 /244 variables (removed 140) and now considering 192/332 (removed 140) transitions.
[2024-05-26 14:11:12] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
// Phase 1: matrix 168 rows 104 cols
[2024-05-26 14:11:12] [INFO ] Computed 15 invariants in 8 ms
[2024-05-26 14:11:12] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-26 14:11:12] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
[2024-05-26 14:11:12] [INFO ] Invariant cache hit.
[2024-05-26 14:11:12] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 14:11:12] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2024-05-26 14:11:12] [INFO ] Redundant transitions in 12 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-26 14:11:12] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
[2024-05-26 14:11:12] [INFO ] Invariant cache hit.
[2024-05-26 14:11:12] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-05-26 14:11:14] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-26 14:11:15] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-26 14:11:16] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-26 14:11:16] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-26 14:11:16] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-26 14:11:16] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-26 14:11:16] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-26 14:11:16] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-26 14:11:16] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-26 14:11:16] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-05-26 14:11:16] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-26 14:11:17] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-26 14:11:17] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-26 14:11:17] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-26 14:11:17] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-26 14:11:17] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-26 14:11:17] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-26 14:11:17] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-26 14:11:17] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-26 14:11:17] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:19] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-26 14:11:19] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-26 14:11:19] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-26 14:11:19] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-26 14:11:19] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-26 14:11:19] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-26 14:11:19] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-26 14:11:19] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-26 14:11:19] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-26 14:11:19] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-26 14:11:20] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 3 ms to minimize.
[2024-05-26 14:11:20] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-26 14:11:20] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:21] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-26 14:11:21] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-05-26 14:11:21] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:22] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-26 14:11:22] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-05-26 14:11:22] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-26 14:11:22] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-26 14:11:22] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-26 14:11:22] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-26 14:11:23] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 4/104 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:26] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (OVERLAPS) 168/272 variables, 104/183 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 57/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 14 (OVERLAPS) 0/272 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 240 constraints, problems are : Problem set: 0 solved, 188 unsolved in 25012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 4/104 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:41] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:42] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-26 14:11:42] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:43] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:45] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-05-26 14:11:45] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-26 14:11:45] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-26 14:11:46] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 12 (OVERLAPS) 168/272 variables, 104/191 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 57/248 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 188/436 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 16 (OVERLAPS) 0/272 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 436 constraints, problems are : Problem set: 0 solved, 188 unsolved in 22650 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 72/72 constraints]
After SMT, in 47769ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 47775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/244 places, 192/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48436 ms. Remains : 104/244 places, 192/332 transitions.
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-00
Product exploration explored 100000 steps with 9828 reset in 727 ms.
Stack based approach found an accepted trace after 47 steps with 3 reset with depth 12 and stack size 12 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-00 finished in 49625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(G(p1))))))'
Support contains 76 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 13 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:12:01] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 14:12:01] [INFO ] Computed 15 invariants in 3 ms
[2024-05-26 14:12:01] [INFO ] Implicit Places using invariants in 120 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 122 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 11 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-COL-3-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-01 finished in 361 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((!p0&&(G(p1)||G(p0)))))'
Support contains 56 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:12:02] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:12:02] [INFO ] Invariant cache hit.
[2024-05-26 14:12:02] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-26 14:12:02] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:12:02] [INFO ] Invariant cache hit.
[2024-05-26 14:12:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 14:12:02] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 14:12:02] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:12:02] [INFO ] Invariant cache hit.
[2024-05-26 14:12:02] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:12:05] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 4 ms to minimize.
[2024-05-26 14:12:06] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 3 ms to minimize.
[2024-05-26 14:12:06] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-26 14:12:06] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 4 ms to minimize.
[2024-05-26 14:12:06] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 4 ms to minimize.
[2024-05-26 14:12:06] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 4 ms to minimize.
[2024-05-26 14:12:06] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-05-26 14:12:07] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 3 ms to minimize.
[2024-05-26 14:12:07] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2024-05-26 14:12:07] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 3 ms to minimize.
[2024-05-26 14:12:07] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2024-05-26 14:12:07] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 3 ms to minimize.
[2024-05-26 14:12:07] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 3 ms to minimize.
[2024-05-26 14:12:08] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 3 ms to minimize.
[2024-05-26 14:12:08] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 4 ms to minimize.
[2024-05-26 14:12:08] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 3 ms to minimize.
[2024-05-26 14:12:08] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 3 ms to minimize.
[2024-05-26 14:12:08] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 4 ms to minimize.
[2024-05-26 14:12:08] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 3 ms to minimize.
[2024-05-26 14:12:09] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:12:09] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 3 ms to minimize.
[2024-05-26 14:12:09] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-26 14:12:09] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 3 ms to minimize.
[2024-05-26 14:12:09] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 3 ms to minimize.
[2024-05-26 14:12:09] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
[2024-05-26 14:12:10] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-26 14:12:10] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-26 14:12:10] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 3 ms to minimize.
[2024-05-26 14:12:10] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 2 ms to minimize.
[2024-05-26 14:12:10] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 3 ms to minimize.
[2024-05-26 14:12:10] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-26 14:12:11] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-26 14:12:11] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
[2024-05-26 14:12:11] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-26 14:12:11] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-05-26 14:12:11] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
[2024-05-26 14:12:11] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-05-26 14:12:11] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 3 ms to minimize.
[2024-05-26 14:12:12] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2024-05-26 14:12:12] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:12:15] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 3 ms to minimize.
[2024-05-26 14:12:16] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 3 ms to minimize.
[2024-05-26 14:12:16] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-26 14:12:16] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-26 14:12:16] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-05-26 14:12:16] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-05-26 14:12:16] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-05-26 14:12:17] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-05-26 14:12:17] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-26 14:12:17] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 4 ms to minimize.
[2024-05-26 14:12:18] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-05-26 14:12:18] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2024-05-26 14:12:18] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 3 ms to minimize.
[2024-05-26 14:12:18] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 3 ms to minimize.
[2024-05-26 14:12:19] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-05-26 14:12:19] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-26 14:12:19] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 3 ms to minimize.
[2024-05-26 14:12:20] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 3 ms to minimize.
[2024-05-26 14:12:20] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-26 14:12:20] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:12:22] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 3 ms to minimize.
[2024-05-26 14:12:22] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2024-05-26 14:12:22] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 3 ms to minimize.
[2024-05-26 14:12:23] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-05-26 14:12:23] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-26 14:12:23] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 3 ms to minimize.
[2024-05-26 14:12:24] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-26 14:12:24] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-05-26 14:12:24] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 3 ms to minimize.
[2024-05-26 14:12:24] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 3 ms to minimize.
[2024-05-26 14:12:25] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-05-26 14:12:25] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 3 ms to minimize.
[2024-05-26 14:12:25] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2024-05-26 14:12:26] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-05-26 14:12:26] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-05-26 14:12:26] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 3 ms to minimize.
[2024-05-26 14:12:26] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 3 ms to minimize.
[2024-05-26 14:12:27] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 3 ms to minimize.
[2024-05-26 14:12:27] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:12:30] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-05-26 14:12:31] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 3 ms to minimize.
[2024-05-26 14:12:32] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 3 ms to minimize.
[2024-05-26 14:12:32] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 2 ms to minimize.
[2024-05-26 14:12:32] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-05-26 14:12:32] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 96 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:12:36] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 2 ms to minimize.
[2024-05-26 14:12:36] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 3 ms to minimize.
[2024-05-26 14:12:37] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 2 ms to minimize.
[2024-05-26 14:12:38] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 3 ms to minimize.
[2024-05-26 14:12:38] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-26 14:12:38] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:12:41] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-26 14:12:42] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-05-26 14:12:43] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 4 ms to minimize.
[2024-05-26 14:12:43] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:12:46] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-26 14:12:46] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:12:59] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 3 ms to minimize.
[2024-05-26 14:12:59] [INFO ] Deduced a trap composed of 73 places in 173 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 114 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 99/99 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in LTL mode , in 1 iterations and 60920 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-02
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-02 finished in 61208 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((p0 U ((X(!p2)||p1) U p3))))'
Support contains 72 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:13:03] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:13:03] [INFO ] Invariant cache hit.
[2024-05-26 14:13:03] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-26 14:13:03] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:13:03] [INFO ] Invariant cache hit.
[2024-05-26 14:13:03] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 14:13:04] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 14:13:04] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:13:04] [INFO ] Invariant cache hit.
[2024-05-26 14:13:04] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:13:07] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-05-26 14:13:07] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 3 ms to minimize.
[2024-05-26 14:13:07] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-26 14:13:07] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 4 ms to minimize.
[2024-05-26 14:13:07] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 3 ms to minimize.
[2024-05-26 14:13:07] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 4 ms to minimize.
[2024-05-26 14:13:08] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-26 14:13:08] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 3 ms to minimize.
[2024-05-26 14:13:08] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-05-26 14:13:08] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-26 14:13:08] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-05-26 14:13:08] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 3 ms to minimize.
[2024-05-26 14:13:09] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
[2024-05-26 14:13:09] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-05-26 14:13:09] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 3 ms to minimize.
[2024-05-26 14:13:09] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 3 ms to minimize.
[2024-05-26 14:13:09] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-05-26 14:13:09] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2024-05-26 14:13:10] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
[2024-05-26 14:13:10] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:13:10] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
[2024-05-26 14:13:10] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 4 ms to minimize.
[2024-05-26 14:13:10] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 3 ms to minimize.
[2024-05-26 14:13:11] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-26 14:13:11] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-26 14:13:11] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-26 14:13:11] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-26 14:13:11] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-26 14:13:11] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 3 ms to minimize.
[2024-05-26 14:13:11] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-26 14:13:12] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-26 14:13:12] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-26 14:13:12] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
[2024-05-26 14:13:12] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-26 14:13:12] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-26 14:13:12] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 2 ms to minimize.
[2024-05-26 14:13:13] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-26 14:13:13] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 3 ms to minimize.
[2024-05-26 14:13:13] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 2 ms to minimize.
[2024-05-26 14:13:13] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:13:16] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 3 ms to minimize.
[2024-05-26 14:13:17] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 3 ms to minimize.
[2024-05-26 14:13:17] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2024-05-26 14:13:17] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-05-26 14:13:18] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-05-26 14:13:18] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-05-26 14:13:18] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 3 ms to minimize.
[2024-05-26 14:13:18] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 3 ms to minimize.
[2024-05-26 14:13:18] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-05-26 14:13:19] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 4 ms to minimize.
[2024-05-26 14:13:19] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 3 ms to minimize.
[2024-05-26 14:13:19] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 3 ms to minimize.
[2024-05-26 14:13:20] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 3 ms to minimize.
[2024-05-26 14:13:20] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 3 ms to minimize.
[2024-05-26 14:13:20] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-05-26 14:13:20] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 3 ms to minimize.
[2024-05-26 14:13:21] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 3 ms to minimize.
[2024-05-26 14:13:21] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2024-05-26 14:13:21] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-26 14:13:21] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:13:23] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-05-26 14:13:24] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 3 ms to minimize.
[2024-05-26 14:13:24] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 4 ms to minimize.
[2024-05-26 14:13:24] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 4 ms to minimize.
[2024-05-26 14:13:25] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-26 14:13:25] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 3 ms to minimize.
[2024-05-26 14:13:25] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-26 14:13:26] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 3 ms to minimize.
[2024-05-26 14:13:26] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 3 ms to minimize.
[2024-05-26 14:13:26] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 3 ms to minimize.
[2024-05-26 14:13:26] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 4 ms to minimize.
[2024-05-26 14:13:26] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2024-05-26 14:13:27] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-05-26 14:13:27] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 3 ms to minimize.
[2024-05-26 14:13:28] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-26 14:13:28] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2024-05-26 14:13:28] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 3 ms to minimize.
[2024-05-26 14:13:28] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 3 ms to minimize.
[2024-05-26 14:13:28] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:13:32] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-26 14:13:33] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-05-26 14:13:33] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 3 ms to minimize.
[2024-05-26 14:13:33] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2024-05-26 14:13:33] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
[2024-05-26 14:13:34] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 96 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:13:38] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-26 14:13:38] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 4 ms to minimize.
[2024-05-26 14:13:39] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2024-05-26 14:13:39] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-26 14:13:40] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-26 14:13:40] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:13:43] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-05-26 14:13:44] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-05-26 14:13:45] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 4 ms to minimize.
[2024-05-26 14:13:45] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:13:47] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-26 14:13:47] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:14:00] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 4 ms to minimize.
[2024-05-26 14:14:00] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 114 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 99/99 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in LTL mode , in 1 iterations and 60796 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p3) p2), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-03
Product exploration explored 100000 steps with 3832 reset in 788 ms.
Stack based approach found an accepted trace after 426 steps with 17 reset with depth 27 and stack size 27 in 3 ms.
FORMULA Peterson-COL-3-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-03 finished in 61897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(G(p1))||G(p2))))'
Support contains 100 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:14:05] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:14:05] [INFO ] Invariant cache hit.
[2024-05-26 14:14:05] [INFO ] Implicit Places using invariants in 82 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 88 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-04 finished in 328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))&&G(p1)))))'
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:14:05] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:14:05] [INFO ] Invariant cache hit.
[2024-05-26 14:14:05] [INFO ] Implicit Places using invariants in 174 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 177 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-05 finished in 445 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&&X(G(p1))))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:14:06] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:14:06] [INFO ] Invariant cache hit.
[2024-05-26 14:14:06] [INFO ] Implicit Places using invariants in 127 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 130 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 549 ms.
Stack based approach found an accepted trace after 271 steps with 0 reset with depth 272 and stack size 272 in 2 ms.
FORMULA Peterson-COL-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-06 finished in 871 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 40 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 244 transition count 272
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 184 transition count 272
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 120 place count 184 transition count 224
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 216 place count 136 transition count 224
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 34 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2024-05-26 14:14:06] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 124 cols
[2024-05-26 14:14:06] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 14:14:07] [INFO ] Implicit Places using invariants in 147 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 148 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 10 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 120/244 places, 212/332 transitions.
Stuttering acceptance computed with spot in 48 ms :[p0]
Running random walk in product with property : Peterson-COL-3-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 686 ms.
Stack based approach found an accepted trace after 230 steps with 0 reset with depth 231 and stack size 211 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-07 finished in 949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:14:07] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 14:14:07] [INFO ] Computed 15 invariants in 10 ms
[2024-05-26 14:14:08] [INFO ] Implicit Places using invariants in 141 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 142 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-08
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-08 finished in 237 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((X(((!p1&&(!p1 U (p2||G(!p1)))) U ((!p1 U (p2||G(!p1)))&&p3)))||p0))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:14:08] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:14:08] [INFO ] Invariant cache hit.
[2024-05-26 14:14:08] [INFO ] Implicit Places using invariants in 210 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 212 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-09
Product exploration explored 100000 steps with 12458 reset in 1154 ms.
Product exploration explored 100000 steps with 12426 reset in 922 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 726 ms. (55 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2258 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 676 ms. (59 steps per ms) remains 2/2 properties
[2024-05-26 14:14:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2024-05-26 14:14:11] [INFO ] Computed 11 invariants in 2 ms
[2024-05-26 14:14:11] [INFO ] State equation strengthened by 57 read => feed constraints.
Problem apf4 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 64/548 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p3) p1 p2)), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2))), (F p1), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p1 (NOT p2))))), (F p3), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 246 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2024-05-26 14:14:12] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:14:12] [INFO ] Invariant cache hit.
[2024-05-26 14:14:12] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-26 14:14:13] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2024-05-26 14:14:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 14:14:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-26 14:14:14] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2024-05-26 14:14:14] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 14:14:14] [INFO ] [Nat]Added 57 Read/Feed constraints in 37 ms returned sat
[2024-05-26 14:14:14] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 40 ms.
[2024-05-26 14:14:15] [INFO ] Added : 165 causal constraints over 33 iterations in 1329 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 60 out of 240 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:14:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:14:15] [INFO ] Invariant cache hit.
[2024-05-26 14:14:15] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-26 14:14:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:14:15] [INFO ] Invariant cache hit.
[2024-05-26 14:14:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 14:14:15] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 14:14:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:14:15] [INFO ] Invariant cache hit.
[2024-05-26 14:14:15] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:14:18] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 4 ms to minimize.
[2024-05-26 14:14:19] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 3 ms to minimize.
[2024-05-26 14:14:19] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 3 ms to minimize.
[2024-05-26 14:14:19] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 6 ms to minimize.
[2024-05-26 14:14:19] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-26 14:14:19] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 4 ms to minimize.
[2024-05-26 14:14:20] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 4 ms to minimize.
[2024-05-26 14:14:20] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-05-26 14:14:20] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 4 ms to minimize.
[2024-05-26 14:14:20] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 3 ms to minimize.
[2024-05-26 14:14:20] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
[2024-05-26 14:14:20] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 4 ms to minimize.
[2024-05-26 14:14:21] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 4 ms to minimize.
[2024-05-26 14:14:21] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 4 ms to minimize.
[2024-05-26 14:14:21] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 3 ms to minimize.
[2024-05-26 14:14:21] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 4 ms to minimize.
[2024-05-26 14:14:21] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 2 ms to minimize.
[2024-05-26 14:14:21] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 3 ms to minimize.
[2024-05-26 14:14:22] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 3 ms to minimize.
[2024-05-26 14:14:22] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:14:22] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 4 ms to minimize.
[2024-05-26 14:14:22] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 4 ms to minimize.
[2024-05-26 14:14:23] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 4 ms to minimize.
[2024-05-26 14:14:23] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 3 ms to minimize.
[2024-05-26 14:14:23] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-26 14:14:23] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-26 14:14:23] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
[2024-05-26 14:14:23] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 4 ms to minimize.
[2024-05-26 14:14:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-26 14:14:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-26 14:14:24] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 3 ms to minimize.
[2024-05-26 14:14:24] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-05-26 14:14:24] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-26 14:14:24] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-26 14:14:24] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-26 14:14:24] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-26 14:14:25] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 3 ms to minimize.
[2024-05-26 14:14:25] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 2 ms to minimize.
[2024-05-26 14:14:25] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 3 ms to minimize.
[2024-05-26 14:14:25] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:14:25] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2024-05-26 14:14:26] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 3 ms to minimize.
[2024-05-26 14:14:26] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-05-26 14:14:26] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 3 ms to minimize.
[2024-05-26 14:14:27] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
[2024-05-26 14:14:27] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 3 ms to minimize.
[2024-05-26 14:14:27] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 3 ms to minimize.
[2024-05-26 14:14:27] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 3 ms to minimize.
[2024-05-26 14:14:27] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 4 ms to minimize.
[2024-05-26 14:14:27] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 4 ms to minimize.
[2024-05-26 14:14:28] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 3 ms to minimize.
[2024-05-26 14:14:28] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-05-26 14:14:28] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 3 ms to minimize.
[2024-05-26 14:14:28] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 3 ms to minimize.
[2024-05-26 14:14:28] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 3 ms to minimize.
[2024-05-26 14:14:28] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 3 ms to minimize.
[2024-05-26 14:14:29] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-26 14:14:29] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-26 14:14:29] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-26 14:14:29] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:14:33] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 3 ms to minimize.
[2024-05-26 14:14:34] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 3 ms to minimize.
[2024-05-26 14:14:34] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-26 14:14:34] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 3 ms to minimize.
[2024-05-26 14:14:34] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 3 ms to minimize.
[2024-05-26 14:14:35] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-05-26 14:14:36] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 3 ms to minimize.
[2024-05-26 14:14:36] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-26 14:14:37] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 3 ms to minimize.
[2024-05-26 14:14:37] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 3 ms to minimize.
[2024-05-26 14:14:37] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-05-26 14:14:37] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 3 ms to minimize.
[2024-05-26 14:14:38] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-05-26 14:14:38] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:14:40] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-05-26 14:14:41] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-26 14:14:42] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:14:44] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 89 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 308/548 variables, 240/329 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 57/386 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 328/714 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 14:15:01] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 715 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 79/79 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in LTL mode , in 1 iterations and 60525 ms. Remains : 240/240 places, 332/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 67 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2024-05-26 14:15:16] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 14:15:16] [INFO ] Invariant cache hit.
[2024-05-26 14:15:17] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-26 14:15:17] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2024-05-26 14:15:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 14:15:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-26 14:15:18] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2024-05-26 14:15:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 14:15:18] [INFO ] [Nat]Added 57 Read/Feed constraints in 31 ms returned sat
[2024-05-26 14:15:18] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 36 ms.
[2024-05-26 14:15:20] [INFO ] Added : 165 causal constraints over 33 iterations in 1592 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 12421 reset in 879 ms.
Product exploration explored 100000 steps with 12471 reset in 525 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 60 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 240 transition count 332
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 39 place count 240 transition count 332
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 240 transition count 332
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 60 place count 240 transition count 332
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 232 transition count 324
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 232 transition count 324
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 76 rules in 37 ms. Remains 232 /240 variables (removed 8) and now considering 324/332 (removed 8) transitions.
[2024-05-26 14:15:22] [INFO ] Redundant transitions in 22 ms returned []
Running 320 sub problems to find dead transitions.
[2024-05-26 14:15:22] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
// Phase 1: matrix 300 rows 232 cols
[2024-05-26 14:15:22] [INFO ] Computed 11 invariants in 2 ms
[2024-05-26 14:15:22] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-26 14:15:24] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 3 ms to minimize.
[2024-05-26 14:15:24] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-26 14:15:24] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-05-26 14:15:25] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2024-05-26 14:15:25] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-05-26 14:15:25] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 3 ms to minimize.
[2024-05-26 14:15:25] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 3 ms to minimize.
[2024-05-26 14:15:25] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-26 14:15:25] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-05-26 14:15:26] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 4 ms to minimize.
[2024-05-26 14:15:26] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-26 14:15:26] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-26 14:15:26] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 3 ms to minimize.
[2024-05-26 14:15:26] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-05-26 14:15:26] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 4 ms to minimize.
[2024-05-26 14:15:27] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-26 14:15:27] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2024-05-26 14:15:27] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 3 ms to minimize.
[2024-05-26 14:15:27] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-26 14:15:27] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-26 14:15:28] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2024-05-26 14:15:28] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-26 14:15:28] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 3 ms to minimize.
[2024-05-26 14:15:28] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 3 ms to minimize.
[2024-05-26 14:15:28] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-05-26 14:15:29] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-05-26 14:15:29] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-26 14:15:29] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 4 ms to minimize.
[2024-05-26 14:15:29] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-05-26 14:15:29] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-26 14:15:29] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-26 14:15:29] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2024-05-26 14:15:30] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-26 14:15:30] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 3 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-26 14:15:30] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 3 ms to minimize.
[2024-05-26 14:15:30] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-26 14:15:30] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-26 14:15:30] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-26 14:15:30] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-26 14:15:30] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 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 TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 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 TDEAD137 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 TDEAD144 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 20/51 constraints. Problems are: Problem set: 52 solved, 268 unsolved
[2024-05-26 14:15:31] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-26 14:15:31] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 3 ms to minimize.
[2024-05-26 14:15:31] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 4 ms to minimize.
[2024-05-26 14:15:31] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-05-26 14:15:32] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 3 ms to minimize.
[2024-05-26 14:15:32] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 3 ms to minimize.
[2024-05-26 14:15:33] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2024-05-26 14:15:33] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-26 14:15:33] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2024-05-26 14:15:33] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 3 ms to minimize.
[2024-05-26 14:15:34] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-05-26 14:15:34] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-05-26 14:15:34] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-05-26 14:15:34] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-05-26 14:15:35] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-05-26 14:15:35] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 3 ms to minimize.
[2024-05-26 14:15:35] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-26 14:15:36] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 3 ms to minimize.
[2024-05-26 14:15:36] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-05-26 14:15:36] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 20/71 constraints. Problems are: Problem set: 52 solved, 268 unsolved
[2024-05-26 14:15:40] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 1/72 constraints. Problems are: Problem set: 52 solved, 268 unsolved
[2024-05-26 14:15:45] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/73 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/73 constraints. Problems are: Problem set: 52 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 300/532 variables, 232/305 constraints. Problems are: Problem set: 52 solved, 268 unsolved
SMT process timed out in 30076ms, After SMT, problems are : Problem set: 52 solved, 268 unsolved
Search for dead transitions found 52 dead transitions in 30080ms
Found 52 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 52 transitions
Dead transitions reduction (with SMT) removed 52 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 232/240 places, 272/332 transitions.
Graph (complete) has 576 edges and 232 vertex of which 180 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.2 ms
Discarding 52 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 180 /232 variables (removed 52) and now considering 272/272 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 180/240 places, 272/332 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30160 ms. Remains : 180/240 places, 272/332 transitions.
Built C files in :
/tmp/ltsmin5831359309406705886
[2024-05-26 14:15:52] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5831359309406705886
Running compilation step : cd /tmp/ltsmin5831359309406705886;'/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 1496 ms.
Running link step : cd /tmp/ltsmin5831359309406705886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin5831359309406705886;'/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/stateBased6044457666656989019.hoa' '--buchi-type=spotba'
LTSmin run took 183 ms.
FORMULA Peterson-COL-3-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-3-LTLFireability-09 finished in 105923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 40 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:15:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 14:15:54] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 14:15:54] [INFO ] Implicit Places using invariants in 117 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 118 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-10
Product exploration explored 100000 steps with 480 reset in 513 ms.
Stack based approach found an accepted trace after 214 steps with 0 reset with depth 215 and stack size 215 in 2 ms.
FORMULA Peterson-COL-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-10 finished in 799 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||G(p1)))))'
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 244 transition count 269
Reduce places removed 63 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 135 place count 181 transition count 260
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 144 place count 172 transition count 260
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 144 place count 172 transition count 212
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 32 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2024-05-26 14:15:54] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 124 cols
[2024-05-26 14:15:54] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 14:15:55] [INFO ] Implicit Places using invariants in 219 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 220 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 10 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 263 ms. Remains : 120/244 places, 212/332 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 288 ms.
Product exploration explored 100000 steps with 0 reset in 326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 151 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 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 685 ms. (58 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 2/2 properties
[2024-05-26 14:15:56] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 120 cols
[2024-05-26 14:15:56] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 14:15:56] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/108 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/296 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 57/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/308 variables, 12/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:15:57] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-26 14:15:57] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 3 ms to minimize.
[2024-05-26 14:15:57] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-26 14:15:57] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/108 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 188/296 variables, 108/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 57/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/308 variables, 12/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:15:57] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-26 14:15:57] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-26 14:15:57] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-26 14:15:57] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-26 14:15:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-26 14:15:57] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-26 14:15:58] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-26 14:15:58] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-26 14:15:58] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-26 14:15:58] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 10/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:15:58] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-26 14:15:58] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-26 14:15:58] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/308 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 2084ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 24 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 9 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 120/120 places, 212/212 transitions.
RANDOM walk for 40000 steps (8 resets) in 756 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 134378 steps, run visited all 2 properties in 558 ms. (steps per millisecond=240 )
Probabilistic random walk after 134378 steps, saw 27163 distinct states, run finished after 559 ms. (steps per millisecond=240 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 315 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 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2024-05-26 14:16:00] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 14:16:00] [INFO ] Invariant cache hit.
[2024-05-26 14:16:00] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-26 14:16:00] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 14:16:00] [INFO ] Invariant cache hit.
[2024-05-26 14:16:00] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 14:16:00] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-05-26 14:16:00] [INFO ] Redundant transitions in 4 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-26 14:16:00] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 14:16:00] [INFO ] Invariant cache hit.
[2024-05-26 14:16:00] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 2 ms to minimize.
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2024-05-26 14:16:02] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-26 14:16:03] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-26 14:16:04] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-26 14:16:05] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-26 14:16:05] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-26 14:16:05] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-26 14:16:05] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-26 14:16:05] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-26 14:16:05] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 14:16:05] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-26 14:16:05] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-26 14:16:06] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-26 14:16:06] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-26 14:16:06] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-26 14:16:06] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-26 14:16:06] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-26 14:16:06] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-26 14:16:06] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-26 14:16:06] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-26 14:16:06] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-26 14:16:07] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-26 14:16:07] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-26 14:16:07] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-26 14:16:07] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-26 14:16:07] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-26 14:16:07] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-26 14:16:07] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-26 14:16:07] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-26 14:16:07] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 14:16:09] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-26 14:16:09] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-26 14:16:10] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-26 14:16:10] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-26 14:16:10] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-26 14:16:10] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-26 14:16:10] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-26 14:16:10] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-26 14:16:11] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-26 14:16:11] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 14:16:11] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-26 14:16:12] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 3 ms to minimize.
[2024-05-26 14:16:12] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-26 14:16:12] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-26 14:16:12] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-26 14:16:12] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-26 14:16:13] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-26 14:16:14] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-05-26 14:16:14] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-26 14:16:14] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-26 14:16:14] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-26 14:16:15] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 188/308 variables, 120/213 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 57/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 270 constraints, problems are : Problem set: 0 solved, 208 unsolved in 29296 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 82/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (OVERLAPS) 188/308 variables, 120/213 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 57/270 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 208/478 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 478 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17482 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 82/82 constraints]
After SMT, in 46881ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 46886ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47470 ms. Remains : 120/120 places, 212/212 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 458 ms. (87 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
[2024-05-26 14:16:48] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-26 14:16:48] [INFO ] Invariant cache hit.
[2024-05-26 14:16:48] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/108 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/296 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 57/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/308 variables, 12/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:16:48] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-26 14:16:48] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 2 ms to minimize.
[2024-05-26 14:16:48] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-26 14:16:48] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:16:48] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-26 14:16:48] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-26 14:16:49] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-05-26 14:16:49] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/108 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 188/296 variables, 108/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 57/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/308 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:16:49] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-26 14:16:49] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-26 14:16:49] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-26 14:16:49] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/308 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 202 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 1550ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 24 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 9 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 120/120 places, 212/212 transitions.
RANDOM walk for 40000 steps (8 resets) in 772 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 134378 steps, run visited all 2 properties in 498 ms. (steps per millisecond=269 )
Probabilistic random walk after 134378 steps, saw 27163 distinct states, run finished after 498 ms. (steps per millisecond=269 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 327 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Product exploration explored 100000 steps with 0 reset in 282 ms.
Built C files in :
/tmp/ltsmin8634099656443347622
[2024-05-26 14:16:51] [INFO ] Computing symmetric may disable matrix : 212 transitions.
[2024-05-26 14:16:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 14:16:51] [INFO ] Computing symmetric may enable matrix : 212 transitions.
[2024-05-26 14:16:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 14:16:51] [INFO ] Computing Do-Not-Accords matrix : 212 transitions.
[2024-05-26 14:16:51] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 14:16:51] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8634099656443347622
Running compilation step : cd /tmp/ltsmin8634099656443347622;'/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 983 ms.
Running link step : cd /tmp/ltsmin8634099656443347622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8634099656443347622;'/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/stateBased16779473807599545358.hoa' '--buchi-type=spotba'
LTSmin run took 1421 ms.
FORMULA Peterson-COL-3-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-3-LTLFireability-11 finished in 59566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||G(p1))))'
Support contains 52 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 244 transition count 278
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 190 transition count 278
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 108 place count 190 transition count 227
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 210 place count 139 transition count 227
Applied a total of 210 rules in 12 ms. Remains 139 /244 variables (removed 105) and now considering 227/332 (removed 105) transitions.
[2024-05-26 14:16:54] [INFO ] Flow matrix only has 203 transitions (discarded 24 similar events)
// Phase 1: matrix 203 rows 139 cols
[2024-05-26 14:16:54] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 14:16:54] [INFO ] Implicit Places using invariants in 82 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 83 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/244 places, 227/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 135/244 places, 227/332 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 576 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 64 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-12 finished in 727 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 8 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 192 place count 148 transition count 192
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 280 place count 104 transition count 192
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 304 place count 92 transition count 180
Applied a total of 304 rules in 14 ms. Remains 92 /244 variables (removed 152) and now considering 180/332 (removed 152) transitions.
[2024-05-26 14:16:55] [INFO ] Flow matrix only has 156 transitions (discarded 24 similar events)
// Phase 1: matrix 156 rows 92 cols
[2024-05-26 14:16:55] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 14:16:55] [INFO ] Implicit Places using invariants in 129 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 130 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/244 places, 180/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 88/244 places, 180/332 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-13
Product exploration explored 100000 steps with 2075 reset in 203 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-13 finished in 535 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 36 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 244 transition count 290
Reduce places removed 42 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 78 rules applied. Total rules applied 120 place count 202 transition count 254
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 156 place count 166 transition count 254
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 156 place count 166 transition count 230
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 204 place count 142 transition count 230
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 222 place count 133 transition count 221
Applied a total of 222 rules in 23 ms. Remains 133 /244 variables (removed 111) and now considering 221/332 (removed 111) transitions.
[2024-05-26 14:16:55] [INFO ] Flow matrix only has 197 transitions (discarded 24 similar events)
// Phase 1: matrix 197 rows 133 cols
[2024-05-26 14:16:55] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 14:16:55] [INFO ] Implicit Places using invariants in 213 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 214 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/244 places, 221/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 129 /129 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 129/244 places, 221/332 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0]
Running random walk in product with property : Peterson-COL-3-LTLFireability-14
Product exploration explored 100000 steps with 3571 reset in 312 ms.
Stack based approach found an accepted trace after 84 steps with 2 reset with depth 25 and stack size 25 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-14 finished in 672 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)||X(X(G(p1))))))'
Support contains 44 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 14:16:56] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 14:16:56] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 14:16:56] [INFO ] Implicit Places using invariants in 146 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 147 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-15
Product exploration explored 100000 steps with 1137 reset in 185 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-15 finished in 537 ms.
All properties solved by simple procedures.
Total runtime 416106 ms.

BK_STOP 1716733016920

--------------------
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="Peterson-COL-3"
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 Peterson-COL-3, 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 r268-smll-171654407100212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 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 ;