About the Execution of ITS-Tools for DLCround-PT-04a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 415.855 | 84863.00 | 107466.00 | 5524.30 | FFFFFFFFFFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695600524.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is DLCround-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695600524
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 5.5K Mar 6 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 6 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 6 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 6 17:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 6 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 200K Mar 3 18:30 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 DLCround-PT-04a-LTLFireability-00
FORMULA_NAME DLCround-PT-04a-LTLFireability-01
FORMULA_NAME DLCround-PT-04a-LTLFireability-02
FORMULA_NAME DLCround-PT-04a-LTLFireability-03
FORMULA_NAME DLCround-PT-04a-LTLFireability-04
FORMULA_NAME DLCround-PT-04a-LTLFireability-05
FORMULA_NAME DLCround-PT-04a-LTLFireability-06
FORMULA_NAME DLCround-PT-04a-LTLFireability-07
FORMULA_NAME DLCround-PT-04a-LTLFireability-08
FORMULA_NAME DLCround-PT-04a-LTLFireability-09
FORMULA_NAME DLCround-PT-04a-LTLFireability-10
FORMULA_NAME DLCround-PT-04a-LTLFireability-11
FORMULA_NAME DLCround-PT-04a-LTLFireability-12
FORMULA_NAME DLCround-PT-04a-LTLFireability-13
FORMULA_NAME DLCround-PT-04a-LTLFireability-14
FORMULA_NAME DLCround-PT-04a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779628124893
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 13:08:45] [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]
[2026-05-24 13:08:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:08:46] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2026-05-24 13:08:46] [INFO ] Transformed 139 places.
[2026-05-24 13:08:46] [INFO ] Transformed 823 transitions.
[2026-05-24 13:08:46] [INFO ] Found NUPN structural information;
[2026-05-24 13:08:46] [INFO ] Parsed PT model containing 139 places and 823 transitions and 3074 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 91 transitions
Reduce redundant transitions removed 91 transitions.
FORMULA DLCround-PT-04a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 732/732 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 129 transition count 656
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 129 transition count 656
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 129 transition count 653
Drop transitions (Redundant composition of simpler transitions.) removed 208 transitions
Redundant transition composition rules discarded 208 transitions
Iterating global reduction 1 with 208 rules applied. Total rules applied 231 place count 129 transition count 445
Applied a total of 231 rules in 42 ms. Remains 129 /139 variables (removed 10) and now considering 445/732 (removed 287) transitions.
[2026-05-24 13:08:46] [INFO ] Flow matrix only has 109 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7226068511072799085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5720586238774466398.kers'
[2026-05-24 13:08:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7226068511072799085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5720586238774466398.kers]
Normalized transition count is 108 out of 109 initially.
Culling duplicate invariants (modulo rational): removing 60 columns.
Culled 60 columns in 0 ms.
// Phase 1: matrix 108 rows 69 cols 224 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-24 13:08:46] [INFO ] Computed 69 invariants in 0 ms
Computed 69 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5720586238774466398.kers
Total runtime 1 ms.
[2026-05-24 13:08:46] [INFO ] Implicit Places using invariants in 305 ms returned [69, 71, 72, 73, 75, 81, 82, 83, 84, 85, 89, 90, 91, 92, 93, 94, 97, 98, 99, 100, 102, 103, 105, 106, 107, 109, 110, 112, 113, 117, 118, 119, 124, 125, 126, 127]
Discarding 36 places :
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Implicit Place search using SMT only with invariants took 335 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/139 places, 298/732 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 154 transitions
Redundant transition composition rules discarded 154 transitions
Iterating global reduction 0 with 154 rules applied. Total rules applied 154 place count 93 transition count 144
Applied a total of 154 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 144/298 (removed 154) transitions.
[2026-05-24 13:08:46] [INFO ] Flow matrix only has 109 transitions (discarded 35 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12162930526127435554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-542748843855061431.kers'
[2026-05-24 13:08:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12162930526127435554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-542748843855061431.kers]
Normalized transition count is 108 out of 109 initially.
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 108 rows 69 cols 224 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-24 13:08:46] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-542748843855061431.kers
Total runtime 0 ms.
[2026-05-24 13:08:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 13:08:46] [INFO ] Flow matrix only has 109 transitions (discarded 35 similar events)
[2026-05-24 13:08:46] [INFO ] Invariant cache hit.
[2026-05-24 13:08:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:08:46] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/139 places, 144/732 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 502 ms. Remains : 93/139 places, 144/732 transitions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2026-05-24 13:08:46] [INFO ] Flow matrix only has 109 transitions (discarded 35 similar events)
[2026-05-24 13:08:46] [INFO ] Invariant cache hit.
[2026-05-24 13:08:46] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 13:08:46] [INFO ] Flow matrix only has 109 transitions (discarded 35 similar events)
[2026-05-24 13:08:46] [INFO ] Invariant cache hit.
[2026-05-24 13:08:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:08:46] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2026-05-24 13:08:46] [INFO ] Flow matrix only has 109 transitions (discarded 35 similar events)
[2026-05-24 13:08:46] [INFO ] Invariant cache hit.
[2026-05-24 13:08:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 24/93 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 108/201 variables, 93/126 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 1/202 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 127 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5180 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 24/93 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 108/201 variables, 93/126 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 143/269 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/202 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 270 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5258 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10482ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 10496ms
Finished structural reductions in LTL mode , in 1 iterations and 10607 ms. Remains : 93/93 places, 144/144 transitions.
Support contains 51 out of 93 places after structural reductions.
[2026-05-24 13:08:57] [INFO ] Flatten gal took : 24 ms
[2026-05-24 13:08:57] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:08:57] [INFO ] Input system was already deterministic with 144 transitions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 1688 steps (0 resets) in 125 ms. (13 steps per ms) remains 0/38 properties
Computed a total of 25 stabilizing places and 1 stable transitions
Graph (complete) has 176 edges and 93 vertex of which 69 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((X(p0)||F(p1))) U G(p2)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 71 transition count 144
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 63 transition count 128
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 63 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 63 transition count 127
Applied a total of 39 rules in 4 ms. Remains 63 /93 variables (removed 30) and now considering 127/144 (removed 17) transitions.
[2026-05-24 13:08:58] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6356272603010736368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11366181187083997878.kers'
[2026-05-24 13:08:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6356272603010736368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11366181187083997878.kers]
Normalized transition count is 99 out of 100 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 99 rows 61 cols 206 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-24 13:08:58] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11366181187083997878.kers
Total runtime 0 ms.
[2026-05-24 13:08:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 13:08:58] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2026-05-24 13:08:58] [INFO ] Invariant cache hit.
[2026-05-24 13:08:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:08:58] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-24 13:08:58] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2026-05-24 13:08:58] [INFO ] Invariant cache hit.
[2026-05-24 13:08:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/162 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 75 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3451 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/162 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 126/200 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 201 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3217 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6687ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 6687ms
Starting structural reductions in LTL mode, iteration 1 : 63/93 places, 127/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6756 ms. Remains : 63/93 places, 127/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((X(p0)||F(p1))) U G(p2)))))'
Stuttering acceptance computed with spot in 475 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-00
Stuttering criterion allowed to conclude after 18 steps with 3 reset in 2 ms.
FORMULA DLCround-PT-04a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-00 finished in 7332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Graph (trivial) has 137 edges and 93 vertex of which 63 / 93 are part of one of the 8 SCC in 3 ms
Free SCC test removed 55 places
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 50 edges and 38 vertex of which 15 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 15 transition count 16
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 13 transition count 15
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 14 place count 6 transition count 8
Iterating global reduction 2 with 7 rules applied. Total rules applied 21 place count 6 transition count 8
Applied a total of 21 rules in 23 ms. Remains 6 /93 variables (removed 87) and now considering 8/144 (removed 136) transitions.
[2026-05-24 13:09:05] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8944780538219847218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7761785803468359179.kers'
[2026-05-24 13:09:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8944780538219847218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7761785803468359179.kers]
Normalized transition count is 5 out of 6 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 10 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-24 13:09:05] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7761785803468359179.kers
Total runtime 0 ms.
[2026-05-24 13:09:05] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 13:09:05] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 13:09:05] [INFO ] Invariant cache hit.
[2026-05-24 13:09:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:05] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-24 13:09:05] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 13:09:05] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 13:09:05] [INFO ] Invariant cache hit.
[2026-05-24 13:09:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/12 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/12 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/93 places, 8/144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 6/93 places, 8/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-01 finished in 315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((G(p1)||X(p2)))))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 71 transition count 144
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 65 transition count 132
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 65 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 65 transition count 131
Applied a total of 35 rules in 10 ms. Remains 65 /93 variables (removed 28) and now considering 131/144 (removed 13) transitions.
[2026-05-24 13:09:05] [INFO ] Flow matrix only has 102 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14470251082392732846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-38093406694499170.kers'
[2026-05-24 13:09:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14470251082392732846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-38093406694499170.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 101 rows 63 cols 210 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-24 13:09:05] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-38093406694499170.kers
Total runtime 1 ms.
[2026-05-24 13:09:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 13:09:05] [INFO ] Flow matrix only has 102 transitions (discarded 29 similar events)
[2026-05-24 13:09:05] [INFO ] Invariant cache hit.
[2026-05-24 13:09:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:05] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2026-05-24 13:09:05] [INFO ] Flow matrix only has 102 transitions (discarded 29 similar events)
[2026-05-24 13:09:05] [INFO ] Invariant cache hit.
[2026-05-24 13:09:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 101/166 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 1/167 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 77 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3618 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 101/166 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 130/206 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 1/167 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 207 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3375 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7002ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 7003ms
Starting structural reductions in LTL mode, iteration 1 : 65/93 places, 131/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7090 ms. Remains : 65/93 places, 131/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((G(p0)||X(p1)))&&p2))))'
Stuttering acceptance computed with spot in 1084 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-02
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-02 finished in 8216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U ((p0 U p1) U X(p2))) U p3))'
Support contains 8 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 73 transition count 144
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 66 transition count 130
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 66 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 66 transition count 129
Applied a total of 35 rules in 5 ms. Remains 66 /93 variables (removed 27) and now considering 129/144 (removed 15) transitions.
[2026-05-24 13:09:14] [INFO ] Flow matrix only has 101 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9471647149420694019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9800319391126218948.kers'
[2026-05-24 13:09:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9471647149420694019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9800319391126218948.kers]
Normalized transition count is 100 out of 101 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 100 rows 62 cols 208 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-24 13:09:14] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9800319391126218948.kers
Total runtime 1 ms.
[2026-05-24 13:09:14] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 13:09:14] [INFO ] Flow matrix only has 101 transitions (discarded 28 similar events)
[2026-05-24 13:09:14] [INFO ] Invariant cache hit.
[2026-05-24 13:09:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:14] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2026-05-24 13:09:14] [INFO ] Flow matrix only has 101 transitions (discarded 28 similar events)
[2026-05-24 13:09:14] [INFO ] Invariant cache hit.
[2026-05-24 13:09:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 100/166 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 1/167 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 80 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3684 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 100/166 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 128/207 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 1/167 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 208 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3335 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7028ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 7029ms
Starting structural reductions in LTL mode, iteration 1 : 66/93 places, 129/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7112 ms. Remains : 66/93 places, 129/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U ((p0 U p1) U X(p2))) U p3))'
Stuttering acceptance computed with spot in 338 ms :[(NOT p3), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-03 finished in 7509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(p2||X(X(G(p3)))))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 71 transition count 144
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 63 transition count 128
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 63 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 63 transition count 127
Applied a total of 39 rules in 3 ms. Remains 63 /93 variables (removed 30) and now considering 127/144 (removed 17) transitions.
[2026-05-24 13:09:21] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6254584536639935623.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10631515141941657676.kers'
[2026-05-24 13:09:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6254584536639935623.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10631515141941657676.kers]
Normalized transition count is 99 out of 100 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 99 rows 61 cols 206 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-24 13:09:21] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10631515141941657676.kers
Total runtime 0 ms.
[2026-05-24 13:09:21] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 13:09:21] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2026-05-24 13:09:21] [INFO ] Invariant cache hit.
[2026-05-24 13:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:21] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-24 13:09:21] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2026-05-24 13:09:21] [INFO ] Invariant cache hit.
[2026-05-24 13:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/162 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 75 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3474 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/162 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 126/200 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 201 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3208 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6690ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 6690ms
Starting structural reductions in LTL mode, iteration 1 : 63/93 places, 127/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6773 ms. Remains : 63/93 places, 127/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(p2||X(X(G(p3)))))))'
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3), (NOT p3)]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-04 finished in 7007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F((p0 U (p1||G(p0)))) U X(p2)) U X(!p0)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 70 transition count 144
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 62 transition count 128
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 62 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 62 transition count 127
Applied a total of 40 rules in 9 ms. Remains 62 /93 variables (removed 31) and now considering 127/144 (removed 17) transitions.
[2026-05-24 13:09:28] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13951789662318704646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-629390096981966624.kers'
[2026-05-24 13:09:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13951789662318704646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-629390096981966624.kers]
Normalized transition count is 99 out of 100 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 99 rows 61 cols 206 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-24 13:09:28] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-629390096981966624.kers
Total runtime 1 ms.
[2026-05-24 13:09:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 13:09:28] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2026-05-24 13:09:28] [INFO ] Invariant cache hit.
[2026-05-24 13:09:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:28] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-24 13:09:28] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2026-05-24 13:09:28] [INFO ] Invariant cache hit.
[2026-05-24 13:09:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/161 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 73 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3307 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/161 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 126/198 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 1/162 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 199 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3074 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6388ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 6389ms
Starting structural reductions in LTL mode, iteration 1 : 62/93 places, 127/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6472 ms. Remains : 62/93 places, 127/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F((p0 U (G(p0)||p1))) U X(p2)) U X(!p0)))))'
Stuttering acceptance computed with spot in 257 ms :[p0, p0, false, p0, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-05 finished in 6792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Graph (trivial) has 136 edges and 93 vertex of which 62 / 93 are part of one of the 9 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Graph (complete) has 57 edges and 40 vertex of which 18 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 17 transition count 24
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 10 place count 11 transition count 18
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 11 transition count 16
Applied a total of 18 rules in 6 ms. Remains 11 /93 variables (removed 82) and now considering 16/144 (removed 128) transitions.
[2026-05-24 13:09:35] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15129004796444460324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10196877708138671911.kers'
[2026-05-24 13:09:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15129004796444460324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10196877708138671911.kers]
Normalized transition count is 9 out of 10 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 19 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 13:09:35] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10196877708138671911.kers
Total runtime 0 ms.
[2026-05-24 13:09:35] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 13:09:35] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2026-05-24 13:09:35] [INFO ] Invariant cache hit.
[2026-05-24 13:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:35] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2026-05-24 13:09:35] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-24 13:09:35] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2026-05-24 13:09:35] [INFO ] Invariant cache hit.
[2026-05-24 13:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/20 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 17 constraints, problems are : Problem set: 0 solved, 15 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/20 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 32 constraints, problems are : Problem set: 0 solved, 15 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 303ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/93 places, 16/144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 11/93 places, 16/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-06
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-06 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Graph (trivial) has 130 edges and 93 vertex of which 60 / 93 are part of one of the 9 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 62 edges and 42 vertex of which 19 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 18 transition count 29
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 11 place count 11 transition count 21
Iterating global reduction 2 with 7 rules applied. Total rules applied 18 place count 11 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 11 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 11 transition count 19
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 10 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 10 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 10 transition count 17
Applied a total of 24 rules in 11 ms. Remains 10 /93 variables (removed 83) and now considering 17/144 (removed 127) transitions.
[2026-05-24 13:09:35] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13304734911359281819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16744702077277840428.kers'
[2026-05-24 13:09:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13304734911359281819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16744702077277840428.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 21 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 13:09:35] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16744702077277840428.kers
Total runtime 1 ms.
[2026-05-24 13:09:35] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 13:09:35] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
[2026-05-24 13:09:35] [INFO ] Invariant cache hit.
[2026-05-24 13:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:35] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-24 13:09:35] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-24 13:09:35] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
[2026-05-24 13:09:35] [INFO ] Invariant cache hit.
[2026-05-24 13:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/20 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 15 constraints, problems are : Problem set: 0 solved, 16 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/20 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/21 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 31 constraints, problems are : Problem set: 0 solved, 16 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 328ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/93 places, 17/144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 389 ms. Remains : 10/93 places, 17/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-07 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (F(p1)&&X((F(p3)&&p2)))))'
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 73 transition count 144
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 66 transition count 130
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 66 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 66 transition count 129
Applied a total of 35 rules in 5 ms. Remains 66 /93 variables (removed 27) and now considering 129/144 (removed 15) transitions.
[2026-05-24 13:09:36] [INFO ] Flow matrix only has 101 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2429306866235558920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4462615221837919717.kers'
[2026-05-24 13:09:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2429306866235558920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4462615221837919717.kers]
Normalized transition count is 100 out of 101 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 100 rows 62 cols 208 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-24 13:09:36] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4462615221837919717.kers
Total runtime 2 ms.
[2026-05-24 13:09:36] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 13:09:36] [INFO ] Flow matrix only has 101 transitions (discarded 28 similar events)
[2026-05-24 13:09:36] [INFO ] Invariant cache hit.
[2026-05-24 13:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:36] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2026-05-24 13:09:36] [INFO ] Flow matrix only has 101 transitions (discarded 28 similar events)
[2026-05-24 13:09:36] [INFO ] Invariant cache hit.
[2026-05-24 13:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 100/166 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 1/167 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 80 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3603 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 100/166 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 128/207 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 1/167 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 208 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3368 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6979ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 6979ms
Starting structural reductions in LTL mode, iteration 1 : 66/93 places, 129/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7060 ms. Remains : 66/93 places, 129/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (F(p1)&&X((F(p3)&&p2)))))'
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p3) (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p3)]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-08 finished in 7343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U p2))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Graph (trivial) has 120 edges and 93 vertex of which 51 / 93 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Graph (complete) has 82 edges and 51 vertex of which 30 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 28 transition count 48
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 13 place count 21 transition count 39
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 21 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 21 transition count 36
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 21 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 19 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 19 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 19 transition count 31
Applied a total of 32 rules in 12 ms. Remains 19 /93 variables (removed 74) and now considering 31/144 (removed 113) transitions.
[2026-05-24 13:09:43] [INFO ] Flow matrix only has 20 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10174567724053500767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12231282307976741714.kers'
[2026-05-24 13:09:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10174567724053500767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12231282307976741714.kers]
Normalized transition count is 19 out of 20 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 19 rows 15 cols 40 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-24 13:09:43] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12231282307976741714.kers
Total runtime 0 ms.
[2026-05-24 13:09:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 13:09:43] [INFO ] Flow matrix only has 20 transitions (discarded 11 similar events)
[2026-05-24 13:09:43] [INFO ] Invariant cache hit.
[2026-05-24 13:09:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:43] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2026-05-24 13:09:43] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-24 13:09:43] [INFO ] Flow matrix only has 20 transitions (discarded 11 similar events)
[2026-05-24 13:09:43] [INFO ] Invariant cache hit.
[2026-05-24 13:09:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 19/38 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 27 constraints, problems are : Problem set: 0 solved, 30 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 19/38 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 30/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 57 constraints, problems are : Problem set: 0 solved, 30 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 774ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/93 places, 31/144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 843 ms. Remains : 19/93 places, 31/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&p2)))'
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-09 finished in 976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(p1 U p2)&&X(p3))))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 72 transition count 144
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 64 transition count 128
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 64 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 64 transition count 127
Applied a total of 38 rules in 8 ms. Remains 64 /93 variables (removed 29) and now considering 127/144 (removed 17) transitions.
[2026-05-24 13:09:44] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-126743485354118299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11458446548248376440.kers'
[2026-05-24 13:09:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-126743485354118299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11458446548248376440.kers]
Normalized transition count is 99 out of 100 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 99 rows 61 cols 206 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-24 13:09:44] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11458446548248376440.kers
Total runtime 1 ms.
[2026-05-24 13:09:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 13:09:44] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2026-05-24 13:09:44] [INFO ] Invariant cache hit.
[2026-05-24 13:09:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:44] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-24 13:09:44] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2026-05-24 13:09:44] [INFO ] Invariant cache hit.
[2026-05-24 13:09:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 3/64 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/163 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 1/164 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 77 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3557 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 3/64 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/163 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 126/202 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 1/164 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 203 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3102 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6669ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 6671ms
Starting structural reductions in LTL mode, iteration 1 : 64/93 places, 127/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6748 ms. Remains : 64/93 places, 127/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((p0 U p1)&&X(p2)&&p3)))))'
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-11 finished in 6998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(p1)))&&((G(p3)&&p2) U !p4)))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 71 transition count 144
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 65 transition count 132
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 65 transition count 132
Applied a total of 34 rules in 5 ms. Remains 65 /93 variables (removed 28) and now considering 132/144 (removed 12) transitions.
[2026-05-24 13:09:51] [INFO ] Flow matrix only has 103 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11170716356757968096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9146301100877938874.kers'
[2026-05-24 13:09:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11170716356757968096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9146301100877938874.kers]
Normalized transition count is 102 out of 103 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 102 rows 63 cols 212 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-24 13:09:51] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9146301100877938874.kers
Total runtime 2 ms.
[2026-05-24 13:09:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 13:09:51] [INFO ] Flow matrix only has 103 transitions (discarded 29 similar events)
[2026-05-24 13:09:51] [INFO ] Invariant cache hit.
[2026-05-24 13:09:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:09:51] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2026-05-24 13:09:51] [INFO ] Flow matrix only has 103 transitions (discarded 29 similar events)
[2026-05-24 13:09:51] [INFO ] Invariant cache hit.
[2026-05-24 13:09:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 102/167 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 77 constraints, problems are : Problem set: 0 solved, 131 unsolved in 3691 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 102/167 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 131/207 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/168 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 208 constraints, problems are : Problem set: 0 solved, 131 unsolved in 3532 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7228ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 7228ms
Starting structural reductions in LTL mode, iteration 1 : 65/93 places, 132/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7314 ms. Remains : 65/93 places, 132/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(p1)))&&((G(p3)&&p2) U !p4)))'
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1) p4), true, (OR (NOT p0) (NOT p1)), (NOT p3), p4, (NOT p1)]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 386 ms.
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 142 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 21 ms. Proved property starting from automaton with 6 states, 13 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 35 ms.
FORMULA DLCround-PT-04a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04a-LTLFireability-12 finished in 8306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1) U (F((!p0&&X(!p0))) U X(X(p0)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 144/144 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 71 transition count 144
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 65 transition count 132
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 65 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 65 transition count 131
Applied a total of 35 rules in 5 ms. Remains 65 /93 variables (removed 28) and now considering 131/144 (removed 13) transitions.
[2026-05-24 13:09:59] [INFO ] Flow matrix only has 102 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6158416411525682882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3250229251102654846.kers'
[2026-05-24 13:09:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6158416411525682882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3250229251102654846.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 101 rows 63 cols 210 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-24 13:09:59] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3250229251102654846.kers
Total runtime 1 ms.
[2026-05-24 13:10:00] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 13:10:00] [INFO ] Flow matrix only has 102 transitions (discarded 29 similar events)
[2026-05-24 13:10:00] [INFO ] Invariant cache hit.
[2026-05-24 13:10:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 13:10:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2026-05-24 13:10:00] [INFO ] Flow matrix only has 102 transitions (discarded 29 similar events)
[2026-05-24 13:10:00] [INFO ] Invariant cache hit.
[2026-05-24 13:10:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 101/166 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 1/167 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 77 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3685 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 101/166 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 130/206 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 1/167 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 207 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3371 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7064ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 7064ms
Starting structural reductions in LTL mode, iteration 1 : 65/93 places, 131/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7131 ms. Remains : 65/93 places, 131/144 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1) U (F((!p0&&X(!p0))) U X(X(p0)))))'
Stuttering acceptance computed with spot in 349 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, p0, p0]
Running random walk in product with property : DLCround-PT-04a-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLFireability-15 finished in 7517 ms.
All properties solved by simple procedures.
Total runtime 81517 ms.
BK_STOP 1779628209756
--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="DLCround-PT-04a"
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-5973"
echo " Executing tool itstools"
echo " Input is DLCround-PT-04a, 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 r098-tall-177955695600524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-04a.tgz
mv DLCround-PT-04a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;
