About the Execution of ITS-Tools for PolyORBNT-COL-S05J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFTFFFFTFFF?TF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254300564.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is PolyORBNT-COL-S05J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254300564
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 92K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749044835812
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-04 13:47:16] [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]
[2025-06-04 13:47:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 13:47:17] [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.
[2025-06-04 13:47:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-04 13:47:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 577 ms
[2025-06-04 13:47:17] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-04 13:47:17] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2025-06-04 13:47:17] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40008 steps (3191 resets) in 1550 ms. (25 steps per ms) remains 7/23 properties
BEST_FIRST walk for 40003 steps (988 resets) in 121 ms. (327 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40002 steps (1244 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
// Phase 1: matrix 38 rows 48 cols
[2025-06-04 13:47:18] [INFO ] Computed 13 invariants in 13 ms
[2025-06-04 13:47:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/41 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 47/86 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 13:47:18] [INFO ] Flatten gal took : 17 ms
[2025-06-04 13:47:18] [INFO ] Flatten gal took : 9 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-04 13:47:18] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 46 ms.
[2025-06-04 13:47:18] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2025-06-04 13:47:18] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-04 13:47:18] [INFO ] Reduced 555 identical enabling conditions.
[2025-06-04 13:47:18] [INFO ] Reduced 555 identical enabling conditions.
[2025-06-04 13:47:18] [INFO ] Reduced 555 identical enabling conditions.
[2025-06-04 13:47:18] [INFO ] Reduced 90 identical enabling conditions.
[2025-06-04 13:47:18] [INFO ] Reduced 90 identical enabling conditions.
[2025-06-04 13:47:18] [INFO ] Reduced 90 identical enabling conditions.
[2025-06-04 13:47:18] [INFO ] Reduced 90 identical enabling conditions.
[2025-06-04 13:47:18] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 374 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Applied a total of 0 rules in 15 ms. Remains 489 /489 variables (removed 0) and now considering 745/745 (removed 0) transitions.
Running 739 sub problems to find dead transitions.
[2025-06-04 13:47:19] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2025-06-04 13:47:19] [INFO ] Computed 82 invariants in 32 ms
[2025-06-04 13:47:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/487 variables, 9/80 constraints. Problems are: Problem set: 78 solved, 661 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 (/ 2.0 3.0))
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/1230 variables, and 80 constraints, problems are : Problem set: 78 solved, 661 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 661 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 3 (OVERLAPS) 9/487 variables, 9/80 constraints. Problems are: Problem set: 78 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:47:54] [INFO ] Deduced a trap composed of 140 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:47:57] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/1230 variables, and 82 constraints, problems are : Problem set: 78 solved, 661 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/739 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40999ms problems are : Problem set: 78 solved, 661 unsolved
Search for dead transitions found 78 dead transitions in 41010ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
[2025-06-04 13:48:00] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
// Phase 1: matrix 663 rows 489 cols
[2025-06-04 13:48:00] [INFO ] Computed 82 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:48:00] [INFO ] Implicit Places using invariants in 544 ms returned []
[2025-06-04 13:48:00] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
[2025-06-04 13:48:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:48:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 13:48:03] [INFO ] Implicit Places using invariants and state equation in 2601 ms returned []
Implicit Place search using SMT with State Equation took 3154 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 489/489 places, 667/745 transitions.
Applied a total of 0 rules in 11 ms. Remains 489 /489 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44212 ms. Remains : 489/489 places, 667/745 transitions.
Support contains 374 out of 489 places after structural reductions.
[2025-06-04 13:48:03] [INFO ] Flatten gal took : 75 ms
[2025-06-04 13:48:03] [INFO ] Flatten gal took : 80 ms
[2025-06-04 13:48:03] [INFO ] Input system was already deterministic with 667 transitions.
RANDOM walk for 35053 steps (2376 resets) in 640 ms. (54 steps per ms) remains 0/25 properties
FORMULA PolyORBNT-COL-S05J30-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 34 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 631
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 631
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 448 transition count 596
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 413 transition count 596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 412 transition count 595
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 412 transition count 595
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 410 transition count 593
Applied a total of 148 rules in 141 ms. Remains 410 /489 variables (removed 79) and now considering 593/667 (removed 74) transitions.
Running 587 sub problems to find dead transitions.
[2025-06-04 13:48:04] [INFO ] Flow matrix only has 589 transitions (discarded 4 similar events)
// Phase 1: matrix 589 rows 410 cols
[2025-06-04 13:48:04] [INFO ] Computed 77 invariants in 7 ms
[2025-06-04 13:48:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:09] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:09] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:09] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:09] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:09] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:09] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:10] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:10] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:10] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:10] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:10] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:10] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:11] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:11] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:11] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:11] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:11] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:11] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:12] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:12] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:14] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:14] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:14] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:14] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:14] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:14] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:14] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:15] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:15] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:15] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:15] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:15] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:15] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:16] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:16] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:16] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:16] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:16] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:16] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:17] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:21] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:21] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:21] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:21] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:22] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:22] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:22] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:22] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:22] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:22] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:23] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:23] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:23] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:23] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:23] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:23] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:24] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:24] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:24] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:24] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/999 variables, and 132 constraints, problems are : Problem set: 0 solved, 587 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 66/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:27] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:30] [INFO ] Deduced a trap composed of 104 places in 174 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:30] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:31] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:31] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:31] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:35] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:38] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/999 variables, and 140 constraints, problems are : Problem set: 0 solved, 587 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 66/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/587 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40389ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 40391ms
[2025-06-04 13:48:45] [INFO ] Flow matrix only has 589 transitions (discarded 4 similar events)
[2025-06-04 13:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:48:45] [INFO ] Implicit Places using invariants in 614 ms returned []
[2025-06-04 13:48:45] [INFO ] Flow matrix only has 589 transitions (discarded 4 similar events)
[2025-06-04 13:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:48:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 13:48:47] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2344 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 13:48:47] [INFO ] Redundant transitions in 29 ms returned []
Running 587 sub problems to find dead transitions.
[2025-06-04 13:48:47] [INFO ] Flow matrix only has 589 transitions (discarded 4 similar events)
[2025-06-04 13:48:47] [INFO ] Invariant cache hit.
[2025-06-04 13:48:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:51] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:52] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:52] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:52] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:52] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:52] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:52] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:52] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:53] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:53] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:53] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:53] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:48:56] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 4/409 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/410 variables, 1/90 constraints. Problems are: Problem set: 17 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:16] [INFO ] Deduced a trap composed of 73 places in 168 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:16] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:16] [INFO ] Deduced a trap composed of 104 places in 175 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:17] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:17] [INFO ] Deduced a trap composed of 134 places in 180 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:17] [INFO ] Deduced a trap composed of 134 places in 176 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:17] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:17] [INFO ] Deduced a trap composed of 134 places in 176 ms of which 46 ms to minimize.
SMT process timed out in 30422ms, After SMT, problems are : Problem set: 17 solved, 570 unsolved
Search for dead transitions found 17 dead transitions in 30424ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 410/489 places, 576/667 transitions.
Applied a total of 0 rules in 27 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 13:49:17] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 73402 ms. Remains : 410/489 places, 576/667 transitions.
Stuttering acceptance computed with spot in 391 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-00
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 4 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-00 finished in 73871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p0)||(!p1 U (p2||G(!p1)))))))))'
Support contains 14 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 488 transition count 666
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 488 transition count 666
Applied a total of 2 rules in 39 ms. Remains 488 /489 variables (removed 1) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:49:18] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 488 cols
[2025-06-04 13:49:18] [INFO ] Computed 82 invariants in 8 ms
[2025-06-04 13:49:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 9/486 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 660 unsolved
SMT process timed out in 20334ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 20336ms
[2025-06-04 13:49:38] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:49:39] [INFO ] Implicit Places using invariants in 908 ms returned []
[2025-06-04 13:49:39] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:49:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:49:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 13:49:42] [INFO ] Implicit Places using invariants and state equation in 2502 ms returned []
Implicit Place search using SMT with State Equation took 3413 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:49:42] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:49:42] [INFO ] Invariant cache hit.
[2025-06-04 13:49:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 9/486 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/488 variables, 2/82 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:10] [INFO ] Deduced a trap composed of 139 places in 245 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:10] [INFO ] Deduced a trap composed of 140 places in 199 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1150 variables, and 84 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/488 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 9/486 variables, 9/80 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 1/81 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 0/81 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 2/488 variables, 2/83 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 1/84 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:28] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:31] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:31] [INFO ] Deduced a trap composed of 175 places in 190 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:32] [INFO ] Deduced a trap composed of 175 places in 186 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:32] [INFO ] Deduced a trap composed of 175 places in 199 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:32] [INFO ] Deduced a trap composed of 205 places in 200 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:32] [INFO ] Deduced a trap composed of 205 places in 192 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:32] [INFO ] Deduced a trap composed of 205 places in 191 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:33] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:33] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 10/94 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:40] [INFO ] Deduced a trap composed of 175 places in 184 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:40] [INFO ] Deduced a trap composed of 175 places in 177 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1150 variables, and 96 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/488 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60321ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 60326ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 488/489 places, 649/667 transitions.
Applied a total of 0 rules in 9 ms. Remains 488 /488 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84129 ms. Remains : 488/489 places, 649/667 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-02
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-02 finished in 84404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0&&G(p1)))))'
Support contains 8 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 28 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:50:42] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 483 cols
[2025-06-04 13:50:42] [INFO ] Computed 77 invariants in 13 ms
[2025-06-04 13:50:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/1145 variables, and 76 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:19] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1145 variables, and 77 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40356ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 40358ms
[2025-06-04 13:51:23] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:51:24] [INFO ] Implicit Places using invariants in 878 ms returned []
[2025-06-04 13:51:24] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:51:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:51:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 13:51:26] [INFO ] Implicit Places using invariants and state equation in 2864 ms returned []
Implicit Place search using SMT with State Equation took 3745 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:51:26] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:51:26] [INFO ] Invariant cache hit.
[2025-06-04 13:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:52] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:53] [INFO ] Deduced a trap composed of 140 places in 177 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 79 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 1/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:20] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:20] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:20] [INFO ] Deduced a trap composed of 76 places in 188 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:21] [INFO ] Deduced a trap composed of 175 places in 182 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:23] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:24] [INFO ] Deduced a trap composed of 148 places in 173 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:24] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:25] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 87 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 60343ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 8 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104488 ms. Remains : 483/489 places, 649/667 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-03
Entered a terminal (fully accepting) state of product in 14693 steps with 1017 reset in 67 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-03 finished in 104719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&(F(p1) U X(X(!p0))))))'
Support contains 32 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 23 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:52:27] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:52:27] [INFO ] Invariant cache hit.
[2025-06-04 13:52:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
SMT process timed out in 20317ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 20318ms
[2025-06-04 13:52:47] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:52:48] [INFO ] Implicit Places using invariants in 874 ms returned []
[2025-06-04 13:52:48] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:52:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:52:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 13:52:50] [INFO ] Implicit Places using invariants and state equation in 1893 ms returned []
Implicit Place search using SMT with State Equation took 2770 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:52:50] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:52:50] [INFO ] Invariant cache hit.
[2025-06-04 13:52:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:16] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:16] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 30 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 79 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 1/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:43] [INFO ] Deduced a trap composed of 138 places in 228 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:44] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:44] [INFO ] Deduced a trap composed of 76 places in 192 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:44] [INFO ] Deduced a trap composed of 175 places in 189 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:46] [INFO ] Deduced a trap composed of 76 places in 220 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:48] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:48] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:48] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 87 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 60367ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 6 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83496 ms. Remains : 483/489 places, 649/667 transitions.
Stuttering acceptance computed with spot in 303 ms :[true, true, true, (AND (NOT p1) p0), (NOT p0), true, (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-05
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-05 finished in 83823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (X(p2)&&p1)))'
Support contains 72 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 16 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:53:51] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:53:51] [INFO ] Invariant cache hit.
[2025-06-04 13:53:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
SMT process timed out in 20328ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 20330ms
[2025-06-04 13:54:11] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:54:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:54:12] [INFO ] Implicit Places using invariants in 738 ms returned []
[2025-06-04 13:54:12] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:54:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:54:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 13:54:15] [INFO ] Implicit Places using invariants and state equation in 3559 ms returned []
Implicit Place search using SMT with State Equation took 4299 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:54:15] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:54:15] [INFO ] Invariant cache hit.
[2025-06-04 13:54:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:41] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:41] [INFO ] Deduced a trap composed of 140 places in 173 ms of which 31 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 79 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 1/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:55:09] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:55:09] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:55:09] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:55:09] [INFO ] Deduced a trap composed of 175 places in 180 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:55:11] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:55:13] [INFO ] Deduced a trap composed of 148 places in 172 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:55:13] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:55:13] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 87 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60343ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 60347ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 8 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85004 ms. Remains : 483/489 places, 649/667 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-06
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-06 finished in 85147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G(p1)) U (p2||X(X(p3)))))'
Support contains 225 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 11 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:55:16] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:55:16] [INFO ] Invariant cache hit.
[2025-06-04 13:55:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
SMT process timed out in 20319ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 20320ms
[2025-06-04 13:55:36] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:55:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:55:37] [INFO ] Implicit Places using invariants in 730 ms returned []
[2025-06-04 13:55:37] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:55:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:55:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 13:55:40] [INFO ] Implicit Places using invariants and state equation in 2550 ms returned []
Implicit Place search using SMT with State Equation took 3283 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:55:40] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:55:40] [INFO ] Invariant cache hit.
[2025-06-04 13:55:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:05] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:06] [INFO ] Deduced a trap composed of 140 places in 223 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 79 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 1/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:33] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:33] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:33] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:34] [INFO ] Deduced a trap composed of 175 places in 197 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:36] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:37] [INFO ] Deduced a trap composed of 148 places in 183 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:38] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:38] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 87 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60360ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 60363ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 3 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83986 ms. Remains : 483/489 places, 649/667 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-07
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 2 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-07 finished in 84306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((p0&&X(p1))))||(p2 U G(!p2)))))'
Support contains 9 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 23 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:56:40] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:56:40] [INFO ] Invariant cache hit.
[2025-06-04 13:56:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
SMT process timed out in 20326ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 20327ms
[2025-06-04 13:57:01] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:57:01] [INFO ] Implicit Places using invariants in 890 ms returned []
[2025-06-04 13:57:01] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:57:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 13:57:04] [INFO ] Implicit Places using invariants and state equation in 2881 ms returned []
Implicit Place search using SMT with State Equation took 3772 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:57:04] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:57:04] [INFO ] Invariant cache hit.
[2025-06-04 13:57:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:30] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:31] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 31 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 79 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 1/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:58] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:58] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:58] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:59] [INFO ] Deduced a trap composed of 175 places in 187 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:01] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:02] [INFO ] Deduced a trap composed of 148 places in 177 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:02] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:03] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 87 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60373ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 60375ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 8 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84511 ms. Remains : 483/489 places, 649/667 transitions.
Stuttering acceptance computed with spot in 446 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), true, (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND p2 p0 (NOT p1)), p2, (AND p2 p0 (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-08
Entered a terminal (fully accepting) state of product in 20893 steps with 1469 reset in 63 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-08 finished in 85047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((G(F(!p0))||(p1&&F(!p0))))||(p2&&X((p2 U (X(p2) U (X(G(p2))||(p2&&X(p2)))))))))))'
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 24 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:58:05] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:58:05] [INFO ] Invariant cache hit.
[2025-06-04 13:58:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
SMT process timed out in 20344ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 20345ms
[2025-06-04 13:58:26] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:58:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:58:27] [INFO ] Implicit Places using invariants in 875 ms returned []
[2025-06-04 13:58:27] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:58:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:58:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 13:58:28] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned []
Implicit Place search using SMT with State Equation took 2759 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:58:28] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 13:58:28] [INFO ] Invariant cache hit.
[2025-06-04 13:58:28] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:55] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:55] [INFO ] Deduced a trap composed of 140 places in 202 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 79 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 1/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:22] [INFO ] Deduced a trap composed of 138 places in 247 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:22] [INFO ] Deduced a trap composed of 138 places in 244 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:22] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:23] [INFO ] Deduced a trap composed of 175 places in 218 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:25] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:27] [INFO ] Deduced a trap composed of 148 places in 209 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:27] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:27] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 19 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 87 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60365ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 60367ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 8 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83509 ms. Remains : 483/489 places, 649/667 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 p2), p0]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-09
Product exploration explored 100000 steps with 6981 reset in 248 ms.
Product exploration explored 100000 steps with 6962 reset in 358 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 p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 248 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND p0 (NOT p2)), (AND p0 p2), p0]
RANDOM walk for 40000 steps (2746 resets) in 337 ms. (118 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (1004 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (627 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
[2025-06-04 13:59:30] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-04 13:59:30] [INFO ] Computed 77 invariants in 8 ms
[2025-06-04 13:59:30] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 236/239 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/303 variables, 33/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/458 variables, 31/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/470 variables, 4/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 481/1128 variables, and 76 constraints, problems are : Problem set: 2 solved, 0 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 70/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 194ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (G (OR p2 (NOT p0))), (G (OR p2 p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 12 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S05J30-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-09 finished in 85195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!X(p0)) U ((X(p1) U !p2)&&p3)))'
Support contains 40 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 21 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-04 13:59:31] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 483 cols
[2025-06-04 13:59:31] [INFO ] Computed 77 invariants in 20 ms
[2025-06-04 13:59:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/1145 variables, and 76 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:07] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 15 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1145 variables, and 77 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40468ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 40471ms
[2025-06-04 14:00:11] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 14:00:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:00:12] [INFO ] Implicit Places using invariants in 857 ms returned []
[2025-06-04 14:00:12] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 14:00:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:00:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:00:15] [INFO ] Implicit Places using invariants and state equation in 2869 ms returned []
Implicit Place search using SMT with State Equation took 3743 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-04 14:00:15] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 14:00:15] [INFO ] Invariant cache hit.
[2025-06-04 14:00:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:41] [INFO ] Deduced a trap composed of 139 places in 198 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:41] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 29 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 79 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 1/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:09] [INFO ] Deduced a trap composed of 138 places in 229 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:09] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:09] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:09] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:11] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:13] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:13] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:13] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 17 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 9)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 0)
(s370 4)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 87 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60378ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 60379ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 9 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104627 ms. Remains : 483/489 places, 649/667 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p3) p2), p0, (OR p2 (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1))), true, (OR (NOT p1) p2)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-10
Entered a terminal (fully accepting) state of product in 421 steps with 31 reset in 2 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-10 finished in 104842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(F(p1) U G(p0)))))'
Support contains 187 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Applied a total of 5 rules in 8 ms. Remains 484 /489 variables (removed 5) and now considering 667/667 (removed 0) transitions.
Running 661 sub problems to find dead transitions.
[2025-06-04 14:01:15] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
// Phase 1: matrix 663 rows 484 cols
[2025-06-04 14:01:15] [INFO ] Computed 77 invariants in 8 ms
[2025-06-04 14:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (OVERLAPS) 5/483 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 661 unsolved
SMT process timed out in 20393ms, After SMT, problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 20396ms
[2025-06-04 14:01:36] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
[2025-06-04 14:01:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:01:36] [INFO ] Implicit Places using invariants in 615 ms returned []
[2025-06-04 14:01:36] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
[2025-06-04 14:01:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:01:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:01:38] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 2659 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2025-06-04 14:01:38] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
[2025-06-04 14:01:38] [INFO ] Invariant cache hit.
[2025-06-04 14:01:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (OVERLAPS) 5/483 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:02] [INFO ] Deduced a trap composed of 140 places in 182 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1147 variables, and 77 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (OVERLAPS) 5/483 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:19] [INFO ] Deduced a trap composed of 148 places in 210 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:19] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:24] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:28] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:28] [INFO ] Deduced a trap composed of 205 places in 188 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:28] [INFO ] Deduced a trap composed of 205 places in 192 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:28] [INFO ] Deduced a trap composed of 235 places in 182 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:28] [INFO ] Deduced a trap composed of 235 places in 182 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:29] [INFO ] Deduced a trap composed of 235 places in 184 ms of which 43 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1147 variables, and 86 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/484 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/661 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Starting structural reductions in LTL mode, iteration 1 : 484/489 places, 667/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83460 ms. Remains : 484/489 places, 667/667 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-12
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-12 finished in 83623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||X(F((!p1 U (G(!p1)||(!p1&&G(!p2)))))))))'
Support contains 40 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 22 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-04 14:02:39] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 483 cols
[2025-06-04 14:02:39] [INFO ] Computed 77 invariants in 7 ms
[2025-06-04 14:02:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
SMT process timed out in 20346ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 20347ms
[2025-06-04 14:02:59] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 14:02:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:03:00] [INFO ] Implicit Places using invariants in 818 ms returned []
[2025-06-04 14:03:00] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 14:03:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:03:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:03:03] [INFO ] Implicit Places using invariants and state equation in 2824 ms returned []
Implicit Place search using SMT with State Equation took 3645 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-04 14:03:03] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
[2025-06-04 14:03:03] [INFO ] Invariant cache hit.
[2025-06-04 14:03:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:29] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:29] [INFO ] Deduced a trap composed of 140 places in 177 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 79 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 1/483 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:56] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:56] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:57] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:57] [INFO ] Deduced a trap composed of 175 places in 188 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:59] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:01] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:01] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:01] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 17 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 9)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 1)
(s367 1)
(s368 0)
(s369 1)
(s370 4)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1145 variables, and 87 constraints, problems are : Problem set: 17 solved, 643 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 60358ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 8 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84383 ms. Remains : 483/489 places, 649/667 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND p0 p1), (AND p0 p1), p1, (AND p0 p1), (AND p2 p1), (AND p2 p1 p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-13
Product exploration explored 100000 steps with 6948 reset in 1162 ms.
Product exploration explored 100000 steps with 6911 reset in 1224 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 108 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[p1, p1, p1, (AND p1 p2)]
RANDOM walk for 40000 steps (2740 resets) in 455 ms. (87 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (56 resets) in 1240 ms. (32 steps per ms) remains 1/1 properties
[2025-06-04 14:04:07] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-04 14:04:07] [INFO ] Computed 77 invariants in 14 ms
[2025-06-04 14:04:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 39/1128 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/71 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 12 factoid took 372 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR p2 p1), (OR p2 p1), (OR p2 p1), p2]
Stuttering acceptance computed with spot in 131 ms :[(OR p2 p1), (OR p2 p1), (OR p2 p1), p2]
Support contains 39 out of 483 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Applied a total of 0 rules in 9 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-04 14:04:07] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-04 14:04:07] [INFO ] Invariant cache hit.
[2025-06-04 14:04:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:24] [INFO ] Deduced a trap composed of 175 places in 229 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:24] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:25] [INFO ] Deduced a trap composed of 175 places in 160 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/1128 variables, and 79 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:38] [INFO ] Deduced a trap composed of 180 places in 168 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:38] [INFO ] Deduced a trap composed of 175 places in 190 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:39] [INFO ] Deduced a trap composed of 175 places in 173 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:40] [INFO ] Deduced a trap composed of 235 places in 173 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:42] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:42] [INFO ] Deduced a trap composed of 208 places in 173 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:42] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:42] [INFO ] Deduced a trap composed of 208 places in 182 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:42] [INFO ] Deduced a trap composed of 146 places in 176 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:43] [INFO ] Deduced a trap composed of 208 places in 196 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:43] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:43] [INFO ] Deduced a trap composed of 208 places in 179 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:43] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:43] [INFO ] Deduced a trap composed of 175 places in 176 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:44] [INFO ] Deduced a trap composed of 175 places in 183 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:44] [INFO ] Deduced a trap composed of 175 places in 180 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:44] [INFO ] Deduced a trap composed of 175 places in 181 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:44] [INFO ] Deduced a trap composed of 175 places in 176 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:44] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:45] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 44 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:47] [INFO ] Deduced a trap composed of 208 places in 210 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:48] [INFO ] Deduced a trap composed of 208 places in 208 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:48] [INFO ] Deduced a trap composed of 208 places in 189 ms of which 39 ms to minimize.
SMT process timed out in 40416ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 40417ms
[2025-06-04 14:04:48] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-04 14:04:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:04:49] [INFO ] Implicit Places using invariants in 832 ms returned []
[2025-06-04 14:04:49] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-04 14:04:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:04:51] [INFO ] Implicit Places using invariants and state equation in 2815 ms returned []
Implicit Place search using SMT with State Equation took 3648 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-04 14:04:51] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-04 14:04:51] [INFO ] Invariant cache hit.
[2025-06-04 14:04:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:08] [INFO ] Deduced a trap composed of 175 places in 223 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:09] [INFO ] Deduced a trap composed of 175 places in 187 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:09] [INFO ] Deduced a trap composed of 175 places in 167 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 1/483 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 80 constraints, problems are : Problem set: 0 solved, 643 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:32] [INFO ] Deduced a trap composed of 180 places in 177 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:33] [INFO ] Deduced a trap composed of 175 places in 184 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:33] [INFO ] Deduced a trap composed of 175 places in 170 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:35] [INFO ] Deduced a trap composed of 235 places in 194 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:36] [INFO ] Deduced a trap composed of 146 places in 192 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:36] [INFO ] Deduced a trap composed of 208 places in 202 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:36] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:37] [INFO ] Deduced a trap composed of 208 places in 194 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:37] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:37] [INFO ] Deduced a trap composed of 208 places in 199 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:37] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:38] [INFO ] Deduced a trap composed of 208 places in 200 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:38] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:38] [INFO ] Deduced a trap composed of 175 places in 183 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:38] [INFO ] Deduced a trap composed of 175 places in 181 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:38] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:39] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:39] [INFO ] Deduced a trap composed of 175 places in 192 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:39] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:39] [INFO ] Deduced a trap composed of 175 places in 173 ms of which 42 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:42] [INFO ] Deduced a trap composed of 208 places in 181 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:42] [INFO ] Deduced a trap composed of 208 places in 180 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:42] [INFO ] Deduced a trap composed of 208 places in 182 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:43] [INFO ] Deduced a trap composed of 208 places in 174 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:44] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:45] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:45] [INFO ] Deduced a trap composed of 175 places in 191 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:45] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:45] [INFO ] Deduced a trap composed of 178 places in 183 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:45] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:46] [INFO ] Deduced a trap composed of 79 places in 200 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:46] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:46] [INFO ] Deduced a trap composed of 79 places in 187 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:46] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:46] [INFO ] Deduced a trap composed of 178 places in 218 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:47] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:47] [INFO ] Deduced a trap composed of 178 places in 182 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:47] [INFO ] Deduced a trap composed of 178 places in 179 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:47] [INFO ] Deduced a trap composed of 178 places in 179 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:05:47] [INFO ] Deduced a trap composed of 178 places in 190 ms of which 45 ms to minimize.
Problem TDEAD221 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 20/119 constraints. Problems are: Problem set: 1 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1128 variables, and 119 constraints, problems are : Problem set: 1 solved, 642 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 1 solved, 642 unsolved
Search for dead transitions found 1 dead transitions in 60346ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/483 places, 648/649 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 482 transition count 648
Applied a total of 1 rules in 11 ms. Remains 482 /483 variables (removed 1) and now considering 648/648 (removed 0) transitions.
[2025-06-04 14:05:52] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
// Phase 1: matrix 644 rows 482 cols
[2025-06-04 14:05:52] [INFO ] Computed 76 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:05:52] [INFO ] Implicit Places using invariants in 553 ms returned []
[2025-06-04 14:05:52] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
[2025-06-04 14:05:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:05:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:05:55] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned []
Implicit Place search using SMT with State Equation took 2863 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 482/483 places, 648/649 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107303 ms. Remains : 482/483 places, 648/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 2292 edges and 482 vertex of which 481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR p2 p1), (OR p2 p1), (OR p2 p1), p2]
RANDOM walk for 9457 steps (668 resets) in 79 ms. (118 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p1)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR p2 p1), (OR p2 p1), (OR p2 p1), p2]
Stuttering acceptance computed with spot in 147 ms :[(OR p2 p1), (OR p2 p1), (OR p2 p1), p2]
Stuttering acceptance computed with spot in 133 ms :[(OR p2 p1), (OR p2 p1), (OR p2 p1), p2]
Product exploration explored 100000 steps with 6885 reset in 513 ms.
Product exploration explored 100000 steps with 6892 reset in 523 ms.
Built C files in :
/tmp/ltsmin14502341895994150784
[2025-06-04 14:05:57] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14502341895994150784
Running compilation step : cd /tmp/ltsmin14502341895994150784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1289 ms.
Running link step : cd /tmp/ltsmin14502341895994150784;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14502341895994150784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15633655948594446382.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 648/648 transitions.
Applied a total of 0 rules in 19 ms. Remains 482 /482 variables (removed 0) and now considering 648/648 (removed 0) transitions.
Running 642 sub problems to find dead transitions.
[2025-06-04 14:06:12] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
[2025-06-04 14:06:12] [INFO ] Invariant cache hit.
[2025-06-04 14:06:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 3 (OVERLAPS) 4/480 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (OVERLAPS) 2/482 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/1126 variables, and 76 constraints, problems are : Problem set: 0 solved, 642 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/482 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 3 (OVERLAPS) 4/480 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (OVERLAPS) 2/482 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1126 variables, and 76 constraints, problems are : Problem set: 0 solved, 642 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/482 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40359ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 40360ms
[2025-06-04 14:06:52] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
[2025-06-04 14:06:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:06:53] [INFO ] Implicit Places using invariants in 718 ms returned []
[2025-06-04 14:06:53] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
[2025-06-04 14:06:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:06:55] [INFO ] Implicit Places using invariants and state equation in 2355 ms returned []
Implicit Place search using SMT with State Equation took 3075 ms to find 0 implicit places.
Running 642 sub problems to find dead transitions.
[2025-06-04 14:06:55] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
[2025-06-04 14:06:55] [INFO ] Invariant cache hit.
[2025-06-04 14:06:55] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 3 (OVERLAPS) 4/480 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (OVERLAPS) 2/482 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 642 unsolved
SMT process timed out in 30318ms, After SMT, problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 30321ms
Finished structural reductions in LTL mode , in 1 iterations and 73781 ms. Remains : 482/482 places, 648/648 transitions.
Built C files in :
/tmp/ltsmin3993537005235412468
[2025-06-04 14:07:26] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3993537005235412468
Running compilation step : cd /tmp/ltsmin3993537005235412468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1157 ms.
Running link step : cd /tmp/ltsmin3993537005235412468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3993537005235412468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10128139777929018474.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 14:07:41] [INFO ] Flatten gal took : 38 ms
[2025-06-04 14:07:41] [INFO ] Flatten gal took : 36 ms
[2025-06-04 14:07:41] [INFO ] Time to serialize gal into /tmp/LTL7920027635294869335.gal : 9 ms
[2025-06-04 14:07:41] [INFO ] Time to serialize properties into /tmp/LTL10000821176537994531.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7920027635294869335.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1612618138382639749.hoa' '-atoms' '/tmp/LTL10000821176537994531.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10000821176537994531.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1612618138382639749.hoa
Detected timeout of ITS tools.
[2025-06-04 14:07:56] [INFO ] Flatten gal took : 32 ms
[2025-06-04 14:07:56] [INFO ] Flatten gal took : 30 ms
[2025-06-04 14:07:56] [INFO ] Time to serialize gal into /tmp/LTL10791580814391695073.gal : 5 ms
[2025-06-04 14:07:56] [INFO ] Time to serialize properties into /tmp/LTL2855354185127123488.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10791580814391695073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2855354185127123488.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(place_522>=3)"))||(X(F((!("((((((((((place_500>=1)&&(ModifiedSrc_0>=2))&&((ModifiedSrc_2>=1)&&(cSources>=7)))||(((place_500>...16114
Formula 0 simplified : X(F!"(place_522>=3)" & XG(F"(((((((((place_500>=1)&&(ModifiedSrc_0>=2))&&((ModifiedSrc_2>=1)&&(cSources>=7)))||(((place_500>=1)&&(Mo...7310
Detected timeout of ITS tools.
[2025-06-04 14:08:11] [INFO ] Flatten gal took : 29 ms
[2025-06-04 14:08:11] [INFO ] Applying decomposition
[2025-06-04 14:08:11] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15525447983304185540.txt' '-o' '/tmp/graph15525447983304185540.bin' '-w' '/tmp/graph15525447983304185540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15525447983304185540.bin' '-l' '-1' '-v' '-w' '/tmp/graph15525447983304185540.weights' '-q' '0' '-e' '0.001'
[2025-06-04 14:08:11] [INFO ] Decomposing Gal with order
[2025-06-04 14:08:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 14:08:12] [INFO ] Removed a total of 661 redundant transitions.
[2025-06-04 14:08:12] [INFO ] Flatten gal took : 116 ms
[2025-06-04 14:08:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 17 ms.
[2025-06-04 14:08:12] [INFO ] Time to serialize gal into /tmp/LTL16756736515372390155.gal : 11 ms
[2025-06-04 14:08:12] [INFO ] Time to serialize properties into /tmp/LTL17989166688657572850.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16756736515372390155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17989166688657572850.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G("(i12.u33.place_522>=3)"))||(X(F((!("((((((((((i12.u33.place_500>=1)&&(i12.u33.ModifiedSrc_0>=2))&&((i12.u33.ModifiedSrc_2>=1)...22268
Formula 0 simplified : X(F!"(i12.u33.place_522>=3)" & XG(F"(((((((((i12.u33.place_500>=1)&&(i12.u33.ModifiedSrc_0>=2))&&((i12.u33.ModifiedSrc_2>=1)&&(i12.u...10140
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-13 finished in 347764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 7 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 632
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 632
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 449 transition count 598
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 415 transition count 598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 414 transition count 597
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 414 transition count 597
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 412 transition count 595
Applied a total of 144 rules in 60 ms. Remains 412 /489 variables (removed 77) and now considering 595/667 (removed 72) transitions.
Running 589 sub problems to find dead transitions.
[2025-06-04 14:08:27] [INFO ] Flow matrix only has 591 transitions (discarded 4 similar events)
// Phase 1: matrix 591 rows 412 cols
[2025-06-04 14:08:27] [INFO ] Computed 77 invariants in 7 ms
[2025-06-04 14:08:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (OVERLAPS) 4/411 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/412 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:45] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:45] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:46] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 38 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 3/80 constraints. Problems are: Problem set: 17 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1003 variables, and 80 constraints, problems are : Problem set: 17 solved, 572 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 572 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 6/72 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 2/74 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/74 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 4 (OVERLAPS) 4/411 variables, 4/78 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 0/78 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 6 (OVERLAPS) 1/412 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 1/80 constraints. Problems are: Problem set: 17 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:09:00] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:09:01] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:09:02] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:09:06] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:09:06] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:09:07] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:09:07] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:09:07] [INFO ] Deduced a trap composed of 136 places in 175 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:09:07] [INFO ] Deduced a trap composed of 166 places in 176 ms of which 45 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 9/89 constraints. Problems are: Problem set: 17 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1003 variables, and 89 constraints, problems are : Problem set: 17 solved, 572 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40400ms problems are : Problem set: 17 solved, 572 unsolved
Search for dead transitions found 17 dead transitions in 40401ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2025-06-04 14:09:07] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2025-06-04 14:09:07] [INFO ] Computed 77 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:09:08] [INFO ] Implicit Places using invariants in 725 ms returned []
[2025-06-04 14:09:08] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2025-06-04 14:09:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:09:10] [INFO ] Implicit Places using invariants and state equation in 1689 ms returned []
Implicit Place search using SMT with State Equation took 2418 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 14:09:10] [INFO ] Redundant transitions in 11 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 412/489 places, 578/667 transitions.
Applied a total of 0 rules in 19 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42916 ms. Remains : 412/489 places, 578/667 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-15
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-15 finished in 42979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||X(F((!p1 U (G(!p1)||(!p1&&G(!p2)))))))))'
[2025-06-04 14:09:10] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9607516663010176912
[2025-06-04 14:09:10] [INFO ] Computing symmetric may disable matrix : 667 transitions.
[2025-06-04 14:09:10] [INFO ] Applying decomposition
[2025-06-04 14:09:10] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:09:10] [INFO ] Computing symmetric may enable matrix : 667 transitions.
[2025-06-04 14:09:10] [INFO ] Flatten gal took : 29 ms
[2025-06-04 14:09:10] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1471044236926286957.txt' '-o' '/tmp/graph1471044236926286957.bin' '-w' '/tmp/graph1471044236926286957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1471044236926286957.bin' '-l' '-1' '-v' '-w' '/tmp/graph1471044236926286957.weights' '-q' '0' '-e' '0.001'
[2025-06-04 14:09:10] [INFO ] Decomposing Gal with order
[2025-06-04 14:09:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 14:09:10] [INFO ] Computing Do-Not-Accords matrix : 667 transitions.
[2025-06-04 14:09:10] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:09:10] [INFO ] Built C files in 246ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9607516663010176912
Running compilation step : cd /tmp/ltsmin9607516663010176912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-04 14:09:10] [INFO ] Removed a total of 809 redundant transitions.
[2025-06-04 14:09:10] [INFO ] Flatten gal took : 89 ms
[2025-06-04 14:09:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 13 ms.
[2025-06-04 14:09:10] [INFO ] Time to serialize gal into /tmp/LTLFireability2493788627103031648.gal : 8 ms
[2025-06-04 14:09:10] [INFO ] Time to serialize properties into /tmp/LTLFireability11448453672443596684.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2493788627103031648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11448453672443596684.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("(i20.u27.place_522>=3)"))||(X(F((!("((((((((((i20.u27.place_500>=1)&&(i20.u27.ModifiedSrc_0>=2))&&((i20.u27.ModifiedSrc_2>=1)...22223
Formula 0 simplified : X(F!"(i20.u27.place_522>=3)" & XG(F"(((((((((i20.u27.place_500>=1)&&(i20.u27.ModifiedSrc_0>=2))&&((i20.u27.ModifiedSrc_2>=1)&&(i20.u...10125
Compilation finished in 1932 ms.
Running link step : cd /tmp/ltsmin9607516663010176912;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9607516663010176912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](!(LTLAPp0==true))||X(<>((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.050: LTL layer: formula: X(([](!(LTLAPp0==true))||X(<>((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))))))
pins2lts-mc-linux64( 2/ 8), 0.050: "X(([](!(LTLAPp0==true))||X(<>((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.051: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.170: There are 671 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.170: State length is 490, there are 692 groups
pins2lts-mc-linux64( 0/ 8), 0.170: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.170: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.170: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.170: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.246: [Blue] ~30 levels ~960 states ~4496 transitions
pins2lts-mc-linux64( 5/ 8), 0.271: [Blue] ~30 levels ~1920 states ~6664 transitions
pins2lts-mc-linux64( 5/ 8), 0.319: [Blue] ~30 levels ~3840 states ~10712 transitions
pins2lts-mc-linux64( 6/ 8), 0.434: [Blue] ~30 levels ~7680 states ~20376 transitions
pins2lts-mc-linux64( 6/ 8), 0.630: [Blue] ~30 levels ~15360 states ~38144 transitions
pins2lts-mc-linux64( 6/ 8), 1.036: [Blue] ~30 levels ~30720 states ~73200 transitions
pins2lts-mc-linux64( 4/ 8), 1.755: [Blue] ~30 levels ~61440 states ~145576 transitions
pins2lts-mc-linux64( 5/ 8), 3.038: [Blue] ~30 levels ~122880 states ~309256 transitions
pins2lts-mc-linux64( 4/ 8), 5.428: [Blue] ~30 levels ~245760 states ~628848 transitions
pins2lts-mc-linux64( 4/ 8), 10.200: [Blue] ~30 levels ~491520 states ~1272768 transitions
pins2lts-mc-linux64( 4/ 8), 18.804: [Blue] ~30 levels ~983040 states ~2576536 transitions
pins2lts-mc-linux64( 7/ 8), 35.384: [Blue] ~30 levels ~1966080 states ~5118800 transitions
pins2lts-mc-linux64( 4/ 8), 68.504: [Blue] ~30 levels ~3932160 states ~10539008 transitions
pins2lts-mc-linux64( 4/ 8), 134.848: [Blue] ~30 levels ~7864320 states ~21440272 transitions
pins2lts-mc-linux64( 7/ 8), 267.494: [Blue] ~30 levels ~15728640 states ~43561168 transitions
pins2lts-mc-linux64( 4/ 8), 535.597: [Blue] ~30 levels ~31457280 states ~87912768 transitions
pins2lts-mc-linux64( 5/ 8), 587.836: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 587.880:
pins2lts-mc-linux64( 0/ 8), 587.880: Explored 33569389 states 94087664 transitions, fanout: 2.803
pins2lts-mc-linux64( 0/ 8), 587.880: Total exploration time 587.710 sec (587.660 sec minimum, 587.679 sec on average)
pins2lts-mc-linux64( 0/ 8), 587.880: States per second: 57119, Transitions per second: 160092
pins2lts-mc-linux64( 0/ 8), 587.880:
pins2lts-mc-linux64( 0/ 8), 587.880: State space has 33570992 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 587.880: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 587.880: blue states: 33569389 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 587.880: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 587.880: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 587.880:
pins2lts-mc-linux64( 0/ 8), 587.880: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 587.880:
pins2lts-mc-linux64( 0/ 8), 587.880: Queue width: 8B, total height: 240, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 587.880: Tree memory: 512.1MB, 16.0 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 587.880: Tree fill ratio (roots/leafs): 25.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 587.880: Stored 674 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 587.880: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 587.880: Est. total memory use: 512.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9607516663010176912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](!(LTLAPp0==true))||X(<>((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9607516663010176912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](!(LTLAPp0==true))||X(<>((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[](!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-04 14:36:30] [INFO ] Applying decomposition
[2025-06-04 14:36:30] [INFO ] Flatten gal took : 295 ms
[2025-06-04 14:36:30] [INFO ] Decomposing Gal with order
[2025-06-04 14:36:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 14:36:31] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[Schedule_Task_E_0],[Schedule_Task_E_1],[Schedule_Task_E_2],[Schedule_Task_E_3],[Schedule_Task_E_4],[Schedule_Task_E_5],[Schedule_Task_E_6],[Schedule_Task_E_7],[Schedule_Task_E_8],[Schedule_Task_E_9],[Schedule_Task_E_10],[Schedule_Task_E_11],[Schedule_Task_E_12],[Schedule_Task_E_13],[Schedule_Task_E_14],[Schedule_Task_E_15],[Schedule_Task_E_16],[Schedule_Task_E_17],[Schedule_Task_E_18],[Schedule_Task_E_19],[Schedule_Task_E_20],[Schedule_Task_E_21],[Schedule_Task_E_22],[Schedule_Task_E_23],[Schedule_Task_E_24],[Schedule_Task_E_25],[Schedule_Task_E_26],[Schedule_Task_E_27],[Schedule_Task_E_28],[Schedule_Task_E_29],[Schedule_Task_E_30],[Schedule_Task_E_31],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0, Perform_Work_B_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1, Perform_Work_B_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2, Perform_Work_B_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3, Perform_Work_B_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4, Perform_Work_B_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5, Perform_Work_B_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6, Perform_Work_B_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7, Perform_Work_B_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8, Perform_Work_B_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9, Perform_Work_B_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10, Perform_Work_B_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11, Perform_Work_B_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12, Perform_Work_B_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13, Perform_Work_B_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14, Perform_Work_B_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15, Perform_Work_B_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16, Perform_Work_B_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17, Perform_Work_B_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18, Perform_Work_B_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19, Perform_Work_B_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20, Perform_Work_B_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21, Perform_Work_B_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22, Perform_Work_B_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23, Perform_Work_B_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24, Perform_Work_B_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25, Perform_Work_B_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26, Perform_Work_B_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27, Perform_Work_B_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28, Perform_Work_B_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29, Perform_Work_B_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30, Perform_Work_B_30],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[ModifiedSrc_0, DataOnSrc_0, TheSour_0],[ModifiedSrc_1, DataOnSrc_1, TheSour_1],[ModifiedSrc_2, DataOnSrc_2, TheSour_2],[ModifiedSrc_3, DataOnSrc_3, TheSour_3],[ModifiedSrc_4, DataOnSrc_4, TheSour_4],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-04 14:36:31] [INFO ] Flatten gal took : 99 ms
[2025-06-04 14:36:31] [INFO ] Time to serialize gal into /tmp/LTLFireability9502277619167846763.gal : 40 ms
[2025-06-04 14:36:31] [INFO ] Time to serialize properties into /tmp/LTLFireability1502247060832713968.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9502277619167846763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1502247060832713968.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X((G("(place_522>=3)"))||(X(F((!("((((((((((place_500>=1)&&(ModifiedSrc_0>=2))&&((ModifiedSrc_2>=1)&&(cSources>=7)))||(((place_500>...16114
Formula 0 simplified : X(F!"(place_522>=3)" & XG(F"(((((((((place_500>=1)&&(ModifiedSrc_0>=2))&&((ModifiedSrc_2>=1)&&(cSources>=7)))||(((place_500>=1)&&(Mo...7310
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="PolyORBNT-COL-S05J30"
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-5832"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J30, 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 r156-tall-174881254300564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J30.tgz
mv PolyORBNT-COL-S05J30 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.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 '
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 ;