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.r018-smll-177946788000228.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 BART-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 221K Mar 5 09:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 805K Mar 5 09:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 97K Mar 5 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 338K Mar 5 09:21 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 118K Mar 15 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 322K Mar 15 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 172K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 376K Mar 5 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Mar 5 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 493K Mar 5 09:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Mar 5 09:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 534K 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 BART-PT-002-LTLFireability-00
FORMULA_NAME BART-PT-002-LTLFireability-01
FORMULA_NAME BART-PT-002-LTLFireability-02
FORMULA_NAME BART-PT-002-LTLFireability-03
FORMULA_NAME BART-PT-002-LTLFireability-04
FORMULA_NAME BART-PT-002-LTLFireability-05
FORMULA_NAME BART-PT-002-LTLFireability-06
FORMULA_NAME BART-PT-002-LTLFireability-07
FORMULA_NAME BART-PT-002-LTLFireability-08
FORMULA_NAME BART-PT-002-LTLFireability-09
FORMULA_NAME BART-PT-002-LTLFireability-10
FORMULA_NAME BART-PT-002-LTLFireability-11
FORMULA_NAME BART-PT-002-LTLFireability-12
FORMULA_NAME BART-PT-002-LTLFireability-13
FORMULA_NAME BART-PT-002-LTLFireability-14
FORMULA_NAME BART-PT-002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779548522082

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 15:02:03] [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-23 15:02:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:02:04] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2026-05-23 15:02:04] [INFO ] Transformed 474 places.
[2026-05-23 15:02:04] [INFO ] Transformed 404 transitions.
[2026-05-23 15:02:04] [INFO ] Found NUPN structural information;
[2026-05-23 15:02:04] [INFO ] Parsed PT model containing 474 places and 404 transitions and 3240 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 264 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 14 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17747951758870101797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8748911422271243333.kers'
[2026-05-23 15:02:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17747951758870101797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8748911422271243333.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 404 rows 264 cols 808 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-05-23 15:02:04] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8748911422271243333.kers
Total runtime 3 ms.
[2026-05-23 15:02:04] [INFO ] Implicit Places using invariants in 389 ms returned []
[2026-05-23 15:02:04] [INFO ] Invariant cache hit.
[2026-05-23 15:02:05] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-23 15:02:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30038 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30030 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Finished structural reductions in LTL mode , in 1 iterations and 61210 ms. Remains : 264/264 places, 404/404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 17 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2026-05-23 15:03:05] [INFO ] Invariant cache hit.
[2026-05-23 15:03:05] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-23 15:03:05] [INFO ] Invariant cache hit.
[2026-05-23 15:03:06] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 264/264 places, 404/404 transitions.
Support contains 264 out of 264 places after structural reductions.
[2026-05-23 15:03:07] [INFO ] Flatten gal took : 132 ms
[2026-05-23 15:03:07] [INFO ] Flatten gal took : 81 ms
[2026-05-23 15:03:07] [INFO ] Input system was already deterministic with 404 transitions.
Reduction of identical properties reduced properties to check from 24 to 19
RANDOM walk for 40000 steps (8 resets) in 991 ms. (40 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
[2026-05-23 15:03:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 132/668 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 145 ms.
Refiners :[Domain max(s): 2/264 constraints, Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BART-PT-002-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA BART-PT-002-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(G(X(p0)))) U p1)||(G(p1) U p1)))'
Support contains 138 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 258 transition count 398
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 258 transition count 398
Applied a total of 12 rules in 75 ms. Remains 258 /264 variables (removed 6) and now considering 398/404 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7159408166185692494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1746408740111136792.kers'
[2026-05-23 15:03:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7159408166185692494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1746408740111136792.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 258 cols 796 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 15:03:08] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1746408740111136792.kers
Total runtime 4 ms.
[2026-05-23 15:03:08] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-23 15:03:08] [INFO ] Invariant cache hit.
[2026-05-23 15:03:09] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-05-23 15:03:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 2/258 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 398/656 variables, 258/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 656/656 variables, and 260 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 2/258 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 398/656 variables, 258/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 326/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/656 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 656/656 variables, and 586 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 258/264 places, 398/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 258/264 places, 398/404 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)))) U p1)||(G(p1) U p1)))'
Stuttering acceptance computed with spot in 505 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : BART-PT-002-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA BART-PT-002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-01 finished in 61320 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((X(X((p0&&X(X(p1)))))&&(X(p3)||p2))))'
Support contains 246 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12457334665892802424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17719089890089833610.kers'
[2026-05-23 15:04:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12457334665892802424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17719089890089833610.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 404 rows 264 cols 808 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-05-23 15:04:09] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17719089890089833610.kers
Total runtime 4 ms.
[2026-05-23 15:04:10] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-23 15:04:10] [INFO ] Invariant cache hit.
[2026-05-23 15:04:10] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-23 15:04:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30022 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Finished structural reductions in LTL mode , in 1 iterations and 60675 ms. Remains : 264/264 places, 404/404 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((X(X((p0&&X(X(p1)))))&&(X(p3)||p2))))'
Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0)), (NOT p3), (OR (NOT p0) (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BART-PT-002-LTLFireability-02
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 1 ms.
FORMULA BART-PT-002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-02 finished in 61257 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((X((!(G(p0)||p1) U X(p2))) U p3)))'
Support contains 20 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 218 transition count 358
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 218 transition count 358
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 130 place count 180 transition count 320
Iterating global reduction 0 with 38 rules applied. Total rules applied 168 place count 180 transition count 320
Applied a total of 168 rules in 42 ms. Remains 180 /264 variables (removed 84) and now considering 320/404 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8935647828558733276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18008362483100376975.kers'
[2026-05-23 15:05:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8935647828558733276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18008362483100376975.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 180 cols 640 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-23 15:05:11] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18008362483100376975.kers
Total runtime 2 ms.
[2026-05-23 15:05:11] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-23 15:05:11] [INFO ] Invariant cache hit.
[2026-05-23 15:05:11] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2026-05-23 15:05:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 2/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 320/500 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 0/500 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 182 constraints, problems are : Problem set: 0 solved, 248 unsolved in 18686 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 2/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 320/500 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 248/430 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 430 constraints, problems are : Problem set: 0 solved, 248 unsolved in 15932 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34655ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 34656ms
Starting structural reductions in LTL mode, iteration 1 : 180/264 places, 320/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35077 ms. Remains : 180/264 places, 320/404 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((X((!(G(p0)||p1) U X(p2))) U p3)))'
Stuttering acceptance computed with spot in 261 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2)), true, p0]
Running random walk in product with property : BART-PT-002-LTLFireability-03
Entered a terminal (fully accepting) state of product in 77 steps with 3 reset in 3 ms.
FORMULA BART-PT-002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-03 finished in 35424 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((!p1 U (!p2||G(!p1))))&&p0)))))'
Support contains 138 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 258 transition count 398
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 258 transition count 398
Applied a total of 12 rules in 8 ms. Remains 258 /264 variables (removed 6) and now considering 398/404 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2318445498881417941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17318446395052151428.kers'
[2026-05-23 15:05:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2318445498881417941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17318446395052151428.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 258 cols 796 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 15:05:46] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17318446395052151428.kers
Total runtime 3 ms.
[2026-05-23 15:05:46] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-23 15:05:46] [INFO ] Invariant cache hit.
[2026-05-23 15:05:46] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-05-23 15:05:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 2/258 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 398/656 variables, 258/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 656/656 variables, and 260 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 2/258 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 398/656 variables, 258/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 326/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/656 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 0/656 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 656/656 variables, and 586 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 258/264 places, 398/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60418 ms. Remains : 258/264 places, 398/404 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((!p1 U (!p2||G(!p1))))&&p0)))))'
Stuttering acceptance computed with spot in 248 ms :[true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : BART-PT-002-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-04 finished in 60713 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(X(X((G(p1) U G(p2)))))||p0)))'
Support contains 178 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 246 transition count 386
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 246 transition count 386
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 234 transition count 374
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 234 transition count 374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 228 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 228 transition count 368
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 222 transition count 362
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 222 transition count 362
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 216 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 216 transition count 356
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 210 transition count 350
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 210 transition count 350
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 112 place count 206 transition count 346
Iterating global reduction 0 with 4 rules applied. Total rules applied 116 place count 206 transition count 346
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 120 place count 202 transition count 342
Iterating global reduction 0 with 4 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 200 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 200 transition count 340
Applied a total of 128 rules in 22 ms. Remains 200 /264 variables (removed 64) and now considering 340/404 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17569316603437287282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6927882457669819299.kers'
[2026-05-23 15:06:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17569316603437287282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6927882457669819299.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 200 cols 680 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-23 15:06:47] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6927882457669819299.kers
Total runtime 3 ms.
[2026-05-23 15:06:47] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-23 15:06:47] [INFO ] Invariant cache hit.
[2026-05-23 15:06:47] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2026-05-23 15:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 2/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 340/540 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 0/540 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 202 constraints, problems are : Problem set: 0 solved, 268 unsolved in 19819 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 2/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 340/540 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 268/470 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/540 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/540 variables, and 470 constraints, problems are : Problem set: 0 solved, 268 unsolved in 16833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36682ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 36683ms
Starting structural reductions in LTL mode, iteration 1 : 200/264 places, 340/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37313 ms. Remains : 200/264 places, 340/404 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(X(X((G(p1) U G(p2)))))||p0)))'
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true, (AND p2 (NOT p1)), (NOT p2)]
Running random walk in product with property : BART-PT-002-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 553 ms.
Product exploration explored 100000 steps with 50000 reset in 409 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 123 ms. Proved property starting from automaton with 8 states, 14 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 141 ms.
FORMULA BART-PT-002-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-002-LTLFireability-06 finished in 38752 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))'
Support contains 18 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 356 edges and 264 vertex of which 82 / 264 are part of one of the 2 SCC in 4 ms
Free SCC test removed 80 places
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 184 transition count 142
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 136 rules applied. Total rules applied 249 place count 72 transition count 118
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 24 rules applied. Total rules applied 273 place count 64 transition count 102
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 24 rules applied. Total rules applied 297 place count 56 transition count 86
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 313 place count 48 transition count 78
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 323 place count 38 transition count 68
Iterating global reduction 5 with 10 rules applied. Total rules applied 333 place count 38 transition count 68
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 343 place count 38 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 345 place count 38 transition count 56
Applied a total of 345 rules in 49 ms. Remains 38 /264 variables (removed 226) and now considering 56/404 (removed 348) transitions.
[2026-05-23 15:07:26] [INFO ] Flow matrix only has 55 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8067351743222282781.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18133006134501632946.kers'
[2026-05-23 15:07:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8067351743222282781.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18133006134501632946.kers]
Normalized transition count is 54 out of 55 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 38 cols 108 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-23 15:07:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-18133006134501632946.kers
Total runtime 11 ms.
[2026-05-23 15:07:26] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 15:07:26] [INFO ] Flow matrix only has 55 transitions (discarded 1 similar events)
[2026-05-23 15:07:26] [INFO ] Invariant cache hit.
[2026-05-23 15:07:26] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2026-05-23 15:07:26] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2026-05-23 15:07:26] [INFO ] Flow matrix only has 55 transitions (discarded 1 similar events)
[2026-05-23 15:07:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 2/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 54/92 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 0/92 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/93 variables, and 40 constraints, problems are : Problem set: 0 solved, 36 unsolved in 914 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 2/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 54/92 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 36/76 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/92 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/93 variables, and 76 constraints, problems are : Problem set: 0 solved, 36 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1784ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1784ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/264 places, 56/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1934 ms. Remains : 38/264 places, 56/404 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))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-07 finished in 1994 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))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 240 place count 140 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 253 place count 135 transition count 275
Iterating global reduction 0 with 5 rules applied. Total rules applied 258 place count 135 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 263 place count 130 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 268 place count 130 transition count 270
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 273 place count 125 transition count 265
Iterating global reduction 0 with 5 rules applied. Total rules applied 278 place count 125 transition count 265
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 283 place count 120 transition count 260
Iterating global reduction 0 with 5 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 293 place count 115 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 298 place count 115 transition count 255
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 301 place count 112 transition count 252
Iterating global reduction 0 with 3 rules applied. Total rules applied 304 place count 112 transition count 252
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 307 place count 109 transition count 249
Iterating global reduction 0 with 3 rules applied. Total rules applied 310 place count 109 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 311 place count 108 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 312 place count 108 transition count 248
Applied a total of 312 rules in 28 ms. Remains 108 /264 variables (removed 156) and now considering 248/404 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7413348425407202259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9879578436501815743.kers'
[2026-05-23 15:07:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7413348425407202259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9879578436501815743.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 108 cols 496 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-23 15:07:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9879578436501815743.kers
Total runtime 1 ms.
[2026-05-23 15:07:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 15:07:28] [INFO ] Invariant cache hit.
[2026-05-23 15:07:28] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2026-05-23 15:07:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 2/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 248/356 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 0/356 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 110 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8078 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 2/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 248/356 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 176/286 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/356 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 286 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15157ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15158ms
Starting structural reductions in LTL mode, iteration 1 : 108/264 places, 248/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15335 ms. Remains : 108/264 places, 248/404 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))))'
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BART-PT-002-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-09 finished in 15481 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||(X((!p1&&X(!p0)))&&F(p2))||G((!p1&&X(!p0)))))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 364 edges and 264 vertex of which 129 / 264 are part of one of the 1 SCC in 1 ms
Free SCC test removed 128 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 136 transition count 142
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 71 transition count 142
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 131 place count 71 transition count 138
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 139 place count 67 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 61 transition count 132
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 61 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 61 transition count 131
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 156 place count 57 transition count 127
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 163 place count 54 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 166 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 51 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 174 place count 49 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 176 place count 49 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 178 place count 47 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 47 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 46 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 46 transition count 116
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 196 place count 39 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 200 place count 39 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 204 place count 37 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 208 place count 37 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 212 place count 35 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 216 place count 35 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 220 place count 33 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 224 place count 33 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 228 place count 31 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 232 place count 31 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 236 place count 29 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 240 place count 29 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 244 place count 27 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 248 place count 27 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 252 place count 25 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 256 place count 25 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 260 place count 23 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 264 place count 23 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 268 place count 21 transition count 55
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 272 place count 21 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 276 place count 19 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 280 place count 19 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 284 place count 17 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 288 place count 17 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 292 place count 15 transition count 37
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 296 place count 15 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 300 place count 13 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 304 place count 13 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 308 place count 11 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 312 place count 11 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 316 place count 9 transition count 19
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 320 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 324 place count 7 transition count 13
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 329 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 331 place count 6 transition count 7
Applied a total of 331 rules in 40 ms. Remains 6 /264 variables (removed 258) and now considering 7/404 (removed 397) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7255487705073250693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2022303685967583689.kers'
[2026-05-23 15:07:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7255487705073250693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2022303685967583689.kers]
Normalized transition count is 6 out of 7 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 6 cols 12 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-23 15:07:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2022303685967583689.kers
Total runtime 0 ms.
[2026-05-23 15:07:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-23 15:07:43] [INFO ] Invariant cache hit.
[2026-05-23 15:07:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-23 15:07:43] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-23 15:07:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/264 places, 7/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 6/264 places, 7/404 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||G((p1&&X(!p0)))||(X((p1&&X(!p0)))&&F(p2))))))'
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : BART-PT-002-LTLFireability-10
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA BART-PT-002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-10 finished in 384 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(p1)&&F(G(p2)))||p0)))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 394 edges and 264 vertex of which 219 / 264 are part of one of the 2 SCC in 1 ms
Free SCC test removed 217 places
Ensure Unique test removed 339 transitions
Reduce isomorphic transitions removed 339 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 46 transition count 36
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 35 rules applied. Total rules applied 65 place count 17 transition count 30
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 71 place count 15 transition count 26
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 6 rules applied. Total rules applied 77 place count 13 transition count 22
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 5 rules applied. Total rules applied 82 place count 11 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 84 place count 10 transition count 18
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 87 place count 7 transition count 15
Iterating global reduction 6 with 3 rules applied. Total rules applied 90 place count 7 transition count 15
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 93 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 95 place count 7 transition count 10
Applied a total of 95 rules in 7 ms. Remains 7 /264 variables (removed 257) and now considering 10/404 (removed 394) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12196702992248587413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12974303237299433732.kers'
[2026-05-23 15:07:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12196702992248587413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12974303237299433732.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 7 cols 18 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-23 15:07:43] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12974303237299433732.kers
Total runtime 0 ms.
[2026-05-23 15:07:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-23 15:07:43] [INFO ] Invariant cache hit.
[2026-05-23 15:07:43] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2026-05-23 15:07:43] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-23 15:07:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/16 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/16 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/264 places, 10/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 7/264 places, 10/404 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(p1)&&F(G(p2)))||p0)))'
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-PT-002-LTLFireability-12
Stuttering criterion allowed to conclude after 14 steps with 2 reset in 5 ms.
FORMULA BART-PT-002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-12 finished in 345 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||G(p1))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 398 edges and 264 vertex of which 132 / 264 are part of one of the 1 SCC in 1 ms
Free SCC test removed 131 places
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 132 transition count 140
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 69 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 129 place count 68 transition count 135
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 137 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 143 place count 58 transition count 129
Iterating global reduction 3 with 6 rules applied. Total rules applied 149 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 154 place count 54 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 158 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 51 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 167 place count 48 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 170 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 46 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 176 place count 44 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 179 place count 43 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 194 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 198 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 202 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 206 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 210 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 214 place count 32 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 218 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 222 place count 30 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 226 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 230 place count 28 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 234 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 238 place count 26 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 242 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 246 place count 24 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 250 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 254 place count 22 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 258 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 262 place count 20 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 266 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 270 place count 18 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 274 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 278 place count 16 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 280 place count 15 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 282 place count 15 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 284 place count 14 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 286 place count 14 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 288 place count 13 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 290 place count 13 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 292 place count 12 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 294 place count 12 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 296 place count 11 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 298 place count 11 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 300 place count 10 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 302 place count 10 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 304 place count 9 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 306 place count 9 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 308 place count 8 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 310 place count 8 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 312 place count 7 transition count 17
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 314 place count 7 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 316 place count 6 transition count 14
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 318 place count 6 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 320 place count 5 transition count 11
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 322 place count 5 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 26 with 2 rules applied. Total rules applied 324 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 1 Pre rules applied. Total rules applied 324 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 326 place count 4 transition count 6
Applied a total of 326 rules in 35 ms. Remains 4 /264 variables (removed 260) and now considering 6/404 (removed 398) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1538666524894157309.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6758858254605655100.kers'
[2026-05-23 15:07:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1538666524894157309.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6758858254605655100.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 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-23 15:07:44] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6758858254605655100.kers
Total runtime 0 ms.
[2026-05-23 15:07:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-23 15:07:44] [INFO ] Invariant cache hit.
[2026-05-23 15:07:44] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2026-05-23 15:07:44] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-23 15:07:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 5 constraints, problems are : Problem set: 0 solved, 3 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/264 places, 6/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 4/264 places, 6/404 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||G(p1))))'
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-002-LTLFireability-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-13 finished in 337 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(p0)||X((p0&&F(p1))))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 239 place count 141 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 246 place count 141 transition count 281
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 251 place count 136 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 261 place count 131 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 266 place count 131 transition count 271
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 271 place count 126 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 281 place count 121 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 291 place count 116 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 300 place count 112 transition count 252
Iterating global reduction 0 with 4 rules applied. Total rules applied 304 place count 112 transition count 252
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 308 place count 108 transition count 248
Iterating global reduction 0 with 4 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 314 place count 106 transition count 246
Iterating global reduction 0 with 2 rules applied. Total rules applied 316 place count 106 transition count 246
Applied a total of 316 rules in 27 ms. Remains 106 /264 variables (removed 158) and now considering 246/404 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9587696469948507319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14269062917677969015.kers'
[2026-05-23 15:07:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9587696469948507319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14269062917677969015.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 106 cols 492 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-23 15:07:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14269062917677969015.kers
Total runtime 1 ms.
[2026-05-23 15:07:44] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 15:07:44] [INFO ] Invariant cache hit.
[2026-05-23 15:07:44] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2026-05-23 15:07:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 2/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 246/352 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 0/352 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 108 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 2/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 246/352 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 174/282 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/352 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 282 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14850ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 14851ms
Starting structural reductions in LTL mode, iteration 1 : 106/264 places, 246/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15028 ms. Remains : 106/264 places, 246/404 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(p0)||X((p0&&F(p1))))))'
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-002-LTLFireability-14
Entered a terminal (fully accepting) state of product in 119 steps with 1 reset in 2 ms.
FORMULA BART-PT-002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-14 finished in 15295 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||X(F(p1))))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 264 transition count 276
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 256 place count 136 transition count 276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 256 place count 136 transition count 267
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 274 place count 127 transition count 267
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 286 place count 115 transition count 255
Iterating global reduction 2 with 12 rules applied. Total rules applied 298 place count 115 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 300 place count 115 transition count 253
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 308 place count 107 transition count 245
Iterating global reduction 3 with 8 rules applied. Total rules applied 316 place count 107 transition count 245
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 322 place count 101 transition count 239
Iterating global reduction 3 with 6 rules applied. Total rules applied 328 place count 101 transition count 239
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 334 place count 95 transition count 233
Iterating global reduction 3 with 6 rules applied. Total rules applied 340 place count 95 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 344 place count 91 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 348 place count 91 transition count 229
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 352 place count 87 transition count 225
Iterating global reduction 3 with 4 rules applied. Total rules applied 356 place count 87 transition count 225
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 358 place count 85 transition count 223
Iterating global reduction 3 with 2 rules applied. Total rules applied 360 place count 85 transition count 223
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 388 place count 71 transition count 209
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 396 place count 71 transition count 201
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 404 place count 67 transition count 197
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 412 place count 67 transition count 189
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 420 place count 63 transition count 185
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 428 place count 63 transition count 177
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 436 place count 59 transition count 173
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 444 place count 59 transition count 165
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 452 place count 55 transition count 161
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 460 place count 55 transition count 153
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 468 place count 51 transition count 149
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 476 place count 51 transition count 141
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 484 place count 47 transition count 137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 492 place count 47 transition count 129
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 500 place count 43 transition count 125
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 508 place count 43 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 516 place count 39 transition count 113
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 524 place count 39 transition count 105
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 532 place count 35 transition count 101
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 540 place count 35 transition count 93
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 548 place count 31 transition count 89
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 556 place count 31 transition count 81
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 564 place count 27 transition count 77
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 572 place count 27 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 580 place count 23 transition count 65
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 588 place count 23 transition count 57
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 596 place count 19 transition count 53
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 604 place count 19 transition count 45
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 612 place count 15 transition count 41
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 620 place count 15 transition count 33
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 628 place count 11 transition count 29
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 636 place count 11 transition count 21
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 644 place count 7 transition count 17
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 19 with 9 rules applied. Total rules applied 653 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 3 rules applied. Total rules applied 656 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 658 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 658 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 660 place count 4 transition count 4
Applied a total of 660 rules in 53 ms. Remains 4 /264 variables (removed 260) and now considering 4/404 (removed 400) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14094920187430422890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15054176655844239151.kers'
[2026-05-23 15:07:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14094920187430422890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15054176655844239151.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-23 15:07:59] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15054176655844239151.kers
Total runtime 2 ms.
[2026-05-23 15:07:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 15:07:59] [INFO ] Invariant cache hit.
[2026-05-23 15:07:59] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2026-05-23 15:07:59] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-23 15:07:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/264 places, 4/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 4/264 places, 4/404 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||X(F(p1))))))'
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-002-LTLFireability-15
Product exploration explored 100000 steps with 9970 reset in 102 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 6 in 1 ms.
FORMULA BART-PT-002-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-15 finished in 489 ms.
All properties solved by simple procedures.
Total runtime 356534 ms.

BK_STOP 1779548880419

--------------------
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="BART-PT-002"
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 BART-PT-002, 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 r018-smll-177946788000228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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