Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028400420.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 CO4-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028400420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 97K 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 CO4-PT-06-LTLFireability-00
FORMULA_NAME CO4-PT-06-LTLFireability-01
FORMULA_NAME CO4-PT-06-LTLFireability-02
FORMULA_NAME CO4-PT-06-LTLFireability-03
FORMULA_NAME CO4-PT-06-LTLFireability-04
FORMULA_NAME CO4-PT-06-LTLFireability-05
FORMULA_NAME CO4-PT-06-LTLFireability-06
FORMULA_NAME CO4-PT-06-LTLFireability-07
FORMULA_NAME CO4-PT-06-LTLFireability-08
FORMULA_NAME CO4-PT-06-LTLFireability-09
FORMULA_NAME CO4-PT-06-LTLFireability-10
FORMULA_NAME CO4-PT-06-LTLFireability-11
FORMULA_NAME CO4-PT-06-LTLFireability-12
FORMULA_NAME CO4-PT-06-LTLFireability-13
FORMULA_NAME CO4-PT-06-LTLFireability-14
FORMULA_NAME CO4-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748605457247

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 11:44:18] [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-05-30 11:44:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:44:18] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2025-05-30 11:44:18] [INFO ] Transformed 383 places.
[2025-05-30 11:44:18] [INFO ] Transformed 454 transitions.
[2025-05-30 11:44:18] [INFO ] Found NUPN structural information;
[2025-05-30 11:44:18] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 334/334 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 273 transition count 333
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 70 place count 214 transition count 272
Iterating global reduction 1 with 59 rules applied. Total rules applied 129 place count 214 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 132 place count 214 transition count 269
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 157 place count 189 transition count 244
Iterating global reduction 2 with 25 rules applied. Total rules applied 182 place count 189 transition count 244
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 187 place count 184 transition count 237
Iterating global reduction 2 with 5 rules applied. Total rules applied 192 place count 184 transition count 237
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 193 place count 183 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 183 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 195 place count 182 transition count 235
Iterating global reduction 2 with 1 rules applied. Total rules applied 196 place count 182 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 197 place count 182 transition count 234
Applied a total of 197 rules in 87 ms. Remains 182 /283 variables (removed 101) and now considering 234/334 (removed 100) transitions.
// Phase 1: matrix 234 rows 182 cols
[2025-05-30 11:44:18] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:44:19] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 11:44:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:44:19] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2025-05-30 11:44:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 234/416 variables, 182/186 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:44:24] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:44:24] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 0/416 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 188 constraints, problems are : Problem set: 0 solved, 233 unsolved in 17122 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/416 variables, 182/188 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 233/421 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:44:42] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 422 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47243ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 47255ms
Starting structural reductions in LTL mode, iteration 1 : 182/283 places, 234/334 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47811 ms. Remains : 182/283 places, 234/334 transitions.
Support contains 31 out of 182 places after structural reductions.
[2025-05-30 11:45:06] [INFO ] Flatten gal took : 35 ms
[2025-05-30 11:45:06] [INFO ] Flatten gal took : 15 ms
[2025-05-30 11:45:06] [INFO ] Input system was already deterministic with 234 transitions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40000 steps (74 resets) in 1182 ms. (33 steps per ms) remains 19/27 properties
BEST_FIRST walk for 4002 steps (29 resets) in 94 ms. (42 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4001 steps (38 resets) in 43 ms. (90 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (38 resets) in 45 ms. (87 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4000 steps (32 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (27 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (30 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (42 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (26 resets) in 102 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (21 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (23 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (26 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (30 resets) in 50 ms. (78 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4001 steps (32 resets) in 37 ms. (105 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (36 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (46 resets) in 9 ms. (400 steps per ms) remains 13/13 properties
[2025-05-30 11:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 57/71 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 160/231 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 129/360 variables, 68/147 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 10/370 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 3/373 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 39/412 variables, 27/182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 4/416 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/416 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 186 constraints, problems are : Problem set: 0 solved, 13 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 57/71 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 160/231 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 129/360 variables, 68/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 10/370 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 3/373 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:09] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/373 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/373 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 39/412 variables, 27/196 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 4/416 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/416 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 0/416 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 200 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2066 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3071ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 11 properties in 431 ms.
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 234/234 transitions.
Graph (trivial) has 185 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 303 edges and 181 vertex of which 165 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 165 transition count 148
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 132 place count 105 transition count 148
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 132 place count 105 transition count 128
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 172 place count 85 transition count 128
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 176 place count 81 transition count 124
Iterating global reduction 2 with 4 rules applied. Total rules applied 180 place count 81 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 181 place count 81 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 79 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 79 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 186 place count 79 transition count 120
Performed 26 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 238 place count 53 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 242 place count 53 transition count 85
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 244 place count 51 transition count 83
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 51 transition count 83
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 5 with 4 rules applied. Total rules applied 250 place count 49 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 49 transition count 80
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 275 place count 37 transition count 81
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 283 place count 37 transition count 73
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 294 place count 26 transition count 51
Iterating global reduction 7 with 11 rules applied. Total rules applied 305 place count 26 transition count 51
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 313 place count 26 transition count 43
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 316 place count 23 transition count 34
Iterating global reduction 8 with 3 rules applied. Total rules applied 319 place count 23 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 321 place count 23 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 323 place count 22 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 326 place count 22 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 333 place count 22 transition count 37
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 337 place count 22 transition count 33
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 342 place count 18 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 343 place count 18 transition count 32
Graph (complete) has 49 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 344 place count 17 transition count 32
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 345 place count 17 transition count 31
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 346 place count 17 transition count 31
Graph (complete) has 46 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 347 place count 16 transition count 31
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 348 place count 16 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 349 place count 15 transition count 29
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t50.t215 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 351 place count 12 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 353 place count 12 transition count 25
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 354 place count 11 transition count 22
Iterating global reduction 16 with 1 rules applied. Total rules applied 355 place count 11 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 356 place count 11 transition count 21
Free-agglomeration rule applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 358 place count 11 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 360 place count 9 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 362 place count 9 transition count 17
Applied a total of 362 rules in 47 ms. Remains 9 /182 variables (removed 173) and now considering 17/234 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 9/182 places, 17/234 transitions.
RANDOM walk for 38 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/2 properties
Computed a total of 13 stabilizing places and 14 stable transitions
Graph (complete) has 305 edges and 182 vertex of which 178 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 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((p0||X(X(p1))))&&X((G(p2) U (p3&&G(p2))))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 174 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 174 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 174 transition count 224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 169 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 169 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 169 transition count 218
Applied a total of 28 rules in 16 ms. Remains 169 /182 variables (removed 13) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 169 cols
[2025-05-30 11:45:11] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:11] [INFO ] Implicit Places using invariants in 44 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/182 places, 218/234 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 168/182 places, 218/234 transitions.
Stuttering acceptance computed with spot in 3828 ms :[(OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p3)), (NOT p1), true, (NOT p2)]
Running random walk in product with property : CO4-PT-06-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CO4-PT-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-00 finished in 3950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Graph (trivial) has 183 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 304 edges and 181 vertex of which 177 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 176 transition count 171
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 120 transition count 171
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 114 place count 120 transition count 150
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 156 place count 99 transition count 150
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 160 place count 95 transition count 146
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 95 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 165 place count 95 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 94 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 94 transition count 144
Performed 28 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 223 place count 66 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 227 place count 66 transition count 105
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 229 place count 64 transition count 103
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 64 transition count 103
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 4 with 4 rules applied. Total rules applied 235 place count 62 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 62 transition count 100
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 264 place count 48 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 273 place count 48 transition count 92
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 284 place count 37 transition count 70
Iterating global reduction 6 with 11 rules applied. Total rules applied 295 place count 37 transition count 70
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 303 place count 37 transition count 62
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 306 place count 34 transition count 53
Iterating global reduction 7 with 3 rules applied. Total rules applied 309 place count 34 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 311 place count 34 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 313 place count 33 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 323 place count 33 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 325 place count 31 transition count 56
Applied a total of 325 rules in 40 ms. Remains 31 /182 variables (removed 151) and now considering 56/234 (removed 178) transitions.
[2025-05-30 11:45:15] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 31 cols
[2025-05-30 11:45:15] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:15] [INFO ] Implicit Places using invariants in 26 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/182 places, 56/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 70 ms. Remains : 30/182 places, 56/234 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CO4-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 3 reset in 198 ms.
Product exploration explored 100000 steps with 14 reset in 86 ms.
Computed a total of 6 stabilizing places and 11 stable transitions
Computed a total of 6 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X p1), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 3860 steps (447 resets) in 61 ms. (62 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X p1), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-05-30 11:45:16] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 30 cols
[2025-05-30 11:45:16] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:16] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 11:45:16] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-05-30 11:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 11:45:17] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:45:17] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2025-05-30 11:45:17] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-05-30 11:45:17] [INFO ] Invariant cache hit.
[2025-05-30 11:45:17] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 48/78 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/79 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 36 constraints, problems are : Problem set: 0 solved, 46 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 48/78 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 46/81 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/79 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 82 constraints, problems are : Problem set: 0 solved, 46 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1788ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1789ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1883 ms. Remains : 30/30 places, 56/56 transitions.
Computed a total of 6 stabilizing places and 11 stable transitions
Computed a total of 6 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X p1), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 164 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 3987 steps (465 resets) in 25 ms. (153 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X p1), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 34 reset in 70 ms.
Product exploration explored 100000 steps with 8 reset in 99 ms.
Built C files in :
/tmp/ltsmin11788945616385501742
[2025-05-30 11:45:20] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2025-05-30 11:45:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:45:20] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2025-05-30 11:45:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:45:20] [INFO ] Computing Do-Not-Accords matrix : 56 transitions.
[2025-05-30 11:45:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:45:20] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11788945616385501742
Running compilation step : cd /tmp/ltsmin11788945616385501742;'/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 394 ms.
Running link step : cd /tmp/ltsmin11788945616385501742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11788945616385501742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased961952466932902962.hoa' '--buchi-type=spotba'
LTSmin run took 72 ms.
FORMULA CO4-PT-06-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-06-LTLFireability-01 finished in 5190 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(X(G((p0||X((X(p0) U (p0&&X(p0))))))))))))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 174 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 174 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 174 transition count 223
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 170 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 170 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 170 transition count 218
Applied a total of 27 rules in 13 ms. Remains 170 /182 variables (removed 12) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 170 cols
[2025-05-30 11:45:20] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:20] [INFO ] Implicit Places using invariants in 61 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/182 places, 218/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 169/182 places, 218/234 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-06-LTLFireability-03
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA CO4-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-03 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Graph (trivial) has 189 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 304 edges and 181 vertex of which 177 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 176 transition count 166
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 115 transition count 165
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 125 place count 115 transition count 144
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 167 place count 94 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 90 transition count 139
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 90 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 176 place count 90 transition count 138
Performed 28 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 232 place count 62 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 237 place count 62 transition count 99
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 239 place count 61 transition count 98
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 241 place count 59 transition count 96
Iterating global reduction 5 with 2 rules applied. Total rules applied 243 place count 59 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 247 place count 57 transition count 94
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 275 place count 43 transition count 95
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 284 place count 43 transition count 86
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 295 place count 32 transition count 64
Iterating global reduction 6 with 11 rules applied. Total rules applied 306 place count 32 transition count 64
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 314 place count 32 transition count 56
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 317 place count 29 transition count 47
Iterating global reduction 7 with 3 rules applied. Total rules applied 320 place count 29 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 322 place count 29 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 326 place count 29 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 328 place count 27 transition count 39
Applied a total of 328 rules in 30 ms. Remains 27 /182 variables (removed 155) and now considering 39/234 (removed 195) transitions.
[2025-05-30 11:45:21] [INFO ] Flow matrix only has 36 transitions (discarded 3 similar events)
// Phase 1: matrix 36 rows 27 cols
[2025-05-30 11:45:21] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:21] [INFO ] Implicit Places using invariants in 31 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/182 places, 39/234 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 26/182 places, 39/234 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-04 finished in 136 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(G(p0)))))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 173 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 173 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 173 transition count 222
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 168 transition count 217
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 168 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 168 transition count 216
Applied a total of 31 rules in 16 ms. Remains 168 /182 variables (removed 14) and now considering 216/234 (removed 18) transitions.
// Phase 1: matrix 216 rows 168 cols
[2025-05-30 11:45:21] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:21] [INFO ] Implicit Places using invariants in 54 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/182 places, 216/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 167/182 places, 216/234 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLFireability-05
Entered a terminal (fully accepting) state of product in 416 steps with 17 reset in 1 ms.
FORMULA CO4-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-05 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Graph (trivial) has 185 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 304 edges and 181 vertex of which 177 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 176 transition count 168
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 117 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 116 transition count 166
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 123 place count 116 transition count 146
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 163 place count 96 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 167 place count 92 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 92 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 91 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 91 transition count 140
Performed 28 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 229 place count 63 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 233 place count 63 transition count 101
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 235 place count 62 transition count 100
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 237 place count 60 transition count 98
Iterating global reduction 5 with 2 rules applied. Total rules applied 239 place count 60 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 59 transition count 97
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 269 place count 45 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 278 place count 45 transition count 90
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 289 place count 34 transition count 68
Iterating global reduction 6 with 11 rules applied. Total rules applied 300 place count 34 transition count 68
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 308 place count 34 transition count 60
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 311 place count 31 transition count 51
Iterating global reduction 7 with 3 rules applied. Total rules applied 314 place count 31 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 316 place count 31 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 320 place count 31 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 322 place count 29 transition count 43
Applied a total of 322 rules in 20 ms. Remains 29 /182 variables (removed 153) and now considering 43/234 (removed 191) transitions.
[2025-05-30 11:45:21] [INFO ] Flow matrix only has 41 transitions (discarded 2 similar events)
// Phase 1: matrix 41 rows 29 cols
[2025-05-30 11:45:21] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:21] [INFO ] Implicit Places using invariants in 28 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/182 places, 43/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52 ms. Remains : 28/182 places, 43/234 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLFireability-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-06 finished in 92 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((p0 U X(X(p0)))))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 173 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 173 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 173 transition count 222
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 168 transition count 217
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 168 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 168 transition count 216
Applied a total of 31 rules in 15 ms. Remains 168 /182 variables (removed 14) and now considering 216/234 (removed 18) transitions.
// Phase 1: matrix 216 rows 168 cols
[2025-05-30 11:45:21] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:21] [INFO ] Implicit Places using invariants in 57 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/182 places, 216/234 transitions.
Applied a total of 0 rules in 1 ms. Remains 167 /167 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 167/182 places, 216/234 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-06-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-07 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&F((p1&&X((p1 U (p2||G(p1))))))))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 173 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 173 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 173 transition count 222
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 168 transition count 217
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 168 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 168 transition count 216
Applied a total of 31 rules in 12 ms. Remains 168 /182 variables (removed 14) and now considering 216/234 (removed 18) transitions.
[2025-05-30 11:45:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:21] [INFO ] Implicit Places using invariants in 55 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/182 places, 216/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 167/182 places, 216/234 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLFireability-08
Product exploration explored 100000 steps with 33396 reset in 97 ms.
Product exploration explored 100000 steps with 33230 reset in 101 ms.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 281 edges and 167 vertex of which 164 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 61 steps (0 resets) in 7 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 139 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 167 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 167 /167 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 167 cols
[2025-05-30 11:45:22] [INFO ] Computed 3 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:22] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-30 11:45:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:23] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-05-30 11:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:27] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:27] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 13991 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:45] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 388 constraints, problems are : Problem set: 0 solved, 215 unsolved in 26996 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41012ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 41015ms
Finished structural reductions in LTL mode , in 1 iterations and 41177 ms. Remains : 167/167 places, 216/216 transitions.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 281 edges and 167 vertex of which 164 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 50 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 74 ms.
Product exploration explored 100000 steps with 25000 reset in 81 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 216/216 transitions.
Graph (trivial) has 175 edges and 167 vertex of which 2 / 167 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 280 edges and 166 vertex of which 163 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 163 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 163 transition count 211
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 57 place count 163 transition count 230
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 78 place count 163 transition count 230
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 152 transition count 219
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 152 transition count 219
Performed 20 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 120 place count 152 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 152 transition count 235
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 136 place count 140 transition count 221
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 148 place count 140 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 140 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 140 transition count 220
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 138 transition count 218
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 138 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 138 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 156 place count 137 transition count 217
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 137 transition count 217
Performed 23 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 180 place count 137 transition count 317
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 201 place count 137 transition count 296
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 245 place count 93 transition count 194
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 5 with 44 rules applied. Total rules applied 289 place count 93 transition count 194
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 306 place count 93 transition count 177
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 335 place count 64 transition count 123
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 364 place count 64 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 367 place count 64 transition count 120
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 373 place count 58 transition count 108
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 379 place count 58 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 380 place count 58 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 387 place count 58 transition count 126
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 390 place count 55 transition count 108
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 393 place count 55 transition count 108
Deduced a syphon composed of 29 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 400 place count 55 transition count 101
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 400 rules in 45 ms. Remains 55 /167 variables (removed 112) and now considering 101/216 (removed 115) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:46:05] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2025-05-30 11:46:05] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
// Phase 1: matrix 98 rows 55 cols
[2025-05-30 11:46:05] [INFO ] Computed 3 invariants in 2 ms
[2025-05-30 11:46:05] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:06] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:06] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:06] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/6 constraints. Problems are: Problem set: 6 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 94 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 4 (OVERLAPS) 97/152 variables, 55/61 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 10/71 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/71 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 1/153 variables, 1/72 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/72 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/153 variables, 0/72 constraints. Problems are: Problem set: 63 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 72 constraints, problems are : Problem set: 63 solved, 37 unsolved in 1728 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 63 solved, 37 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 7/32 variables, 3/3 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 3/6 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 91/123 variables, 32/38 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 10/48 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 37/85 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/85 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 29/152 variables, 23/108 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/108 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 1/153 variables, 1/109 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/109 constraints. Problems are: Problem set: 63 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 0/153 variables, 0/109 constraints. Problems are: Problem set: 63 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 109 constraints, problems are : Problem set: 63 solved, 37 unsolved in 1792 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 37/100 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3537ms problems are : Problem set: 63 solved, 37 unsolved
Search for dead transitions found 63 dead transitions in 3538ms
Found 63 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 63 transitions
Dead transitions reduction (with SMT) removed 63 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/167 places, 38/216 transitions.
Graph (complete) has 76 edges and 55 vertex of which 26 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 26 /55 variables (removed 29) and now considering 38/38 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/167 places, 38/216 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3602 ms. Remains : 26/167 places, 38/216 transitions.
Built C files in :
/tmp/ltsmin11320303434452812697
[2025-05-30 11:46:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11320303434452812697
Running compilation step : cd /tmp/ltsmin11320303434452812697;'/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 301 ms.
Running link step : cd /tmp/ltsmin11320303434452812697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11320303434452812697;'/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/stateBased13178771823430537917.hoa' '--buchi-type=spotba'
LTSmin run took 127 ms.
FORMULA CO4-PT-06-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-06-LTLFireability-08 finished in 47915 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))||G((F(G(p1)) U p1))))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 173 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 173 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 173 transition count 222
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 168 transition count 217
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 168 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 168 transition count 216
Applied a total of 31 rules in 14 ms. Remains 168 /182 variables (removed 14) and now considering 216/234 (removed 18) transitions.
// Phase 1: matrix 216 rows 168 cols
[2025-05-30 11:46:09] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:09] [INFO ] Implicit Places using invariants in 53 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/182 places, 216/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 167/182 places, 216/234 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-06-LTLFireability-10
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-10 finished in 163 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(!p1)&&p0) U X(X(X(p2))))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 173 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 173 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 173 transition count 222
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 168 transition count 217
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 168 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 168 transition count 216
Applied a total of 31 rules in 12 ms. Remains 168 /182 variables (removed 14) and now considering 216/234 (removed 18) transitions.
[2025-05-30 11:46:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 11:46:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:09] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-05-30 11:46:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/384 variables, 168/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:14] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:14] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/384 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 174 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14300 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/384 variables, 168/174 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 215/389 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:31] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 390 constraints, problems are : Problem set: 0 solved, 215 unsolved in 29727 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44051ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 44052ms
Starting structural reductions in LTL mode, iteration 1 : 168/182 places, 216/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44213 ms. Remains : 168/182 places, 216/234 transitions.
Stuttering acceptance computed with spot in 864 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Running random walk in product with property : CO4-PT-06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CO4-PT-06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-11 finished in 45102 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&&F(p1))))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Graph (trivial) has 186 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 304 edges and 181 vertex of which 177 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 176 transition count 170
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 119 transition count 169
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 117 place count 119 transition count 148
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 159 place count 98 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 164 place count 93 transition count 142
Iterating global reduction 2 with 5 rules applied. Total rules applied 169 place count 93 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 93 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 92 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 92 transition count 140
Performed 28 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 228 place count 64 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 232 place count 64 transition count 101
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 234 place count 63 transition count 100
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 236 place count 61 transition count 98
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 61 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 60 transition count 97
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 268 place count 46 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 276 place count 46 transition count 90
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 286 place count 36 transition count 70
Iterating global reduction 6 with 10 rules applied. Total rules applied 296 place count 36 transition count 70
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 303 place count 36 transition count 63
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 306 place count 33 transition count 54
Iterating global reduction 7 with 3 rules applied. Total rules applied 309 place count 33 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 311 place count 33 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 313 place count 32 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 320 place count 32 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 322 place count 30 transition count 53
Applied a total of 322 rules in 35 ms. Remains 30 /182 variables (removed 152) and now considering 53/234 (removed 181) transitions.
[2025-05-30 11:46:54] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
// Phase 1: matrix 46 rows 30 cols
[2025-05-30 11:46:54] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:54] [INFO ] Implicit Places using invariants in 37 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/182 places, 53/234 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 29/182 places, 53/234 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-06-LTLFireability-12
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-12 finished in 164 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&&X(F(p1)))))||(X(!p2)&&G(p3))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 174 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 174 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 174 transition count 223
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 170 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 170 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 170 transition count 218
Applied a total of 27 rules in 17 ms. Remains 170 /182 variables (removed 12) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 170 cols
[2025-05-30 11:46:55] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:55] [INFO ] Implicit Places using invariants in 51 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/182 places, 218/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 169/182 places, 218/234 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-06-LTLFireability-13
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-13 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(F((p0&&X(p1))))&&F(p2))||G(F((p0&&X(p1))))))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 174 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 174 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 174 transition count 223
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 170 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 170 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 170 transition count 218
Applied a total of 27 rules in 9 ms. Remains 170 /182 variables (removed 12) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 170 cols
[2025-05-30 11:46:55] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:55] [INFO ] Implicit Places using invariants in 54 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/182 places, 218/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 169/182 places, 218/234 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-06-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 65 ms.
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-14 finished in 527 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)||(F(p2)&&p1))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 234/234 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 174 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 174 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 174 transition count 223
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 169 transition count 218
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 169 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 169 transition count 217
Applied a total of 29 rules in 6 ms. Remains 169 /182 variables (removed 13) and now considering 217/234 (removed 17) transitions.
// Phase 1: matrix 217 rows 169 cols
[2025-05-30 11:46:55] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:56] [INFO ] Implicit Places using invariants in 49 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/182 places, 217/234 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 168/182 places, 217/234 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CO4-PT-06-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-15 finished in 288 ms.
All properties solved by simple procedures.
Total runtime 157802 ms.

BK_STOP 1748605616314

--------------------
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="CO4-PT-06"
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 CO4-PT-06, 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 r044-tall-174854028400420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-06.tgz
mv CO4-PT-06 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;