About the Execution of ITS-Tools for Champagne-PT-H04T2O
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 496.260 | 388296.00 | 473803.00 | 994.00 | TFFFFFFFFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r050-smll-177946901000020.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 Champagne-PT-H04T2O, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000020
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.4K Mar 6 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 6 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 6 10:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Mar 6 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 6 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 6 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 106K 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 Champagne-PT-H04T2O-LTLFireability-00
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-01
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-02
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-03
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-04
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-05
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-06
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-07
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-08
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-09
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-10
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-11
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-12
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-13
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-14
FORMULA_NAME Champagne-PT-H04T2O-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779482133180
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H04T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 20:35:35] [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-22 20:35:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:35:35] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2026-05-22 20:35:35] [INFO ] Transformed 417 places.
[2026-05-22 20:35:35] [INFO ] Transformed 494 transitions.
[2026-05-22 20:35:35] [INFO ] Found NUPN structural information;
[2026-05-22 20:35:35] [INFO ] Parsed PT model containing 417 places and 494 transitions and 1106 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Champagne-PT-H04T2O-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 494/494 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 349 transition count 426
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 349 transition count 426
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 180 place count 305 transition count 382
Iterating global reduction 0 with 44 rules applied. Total rules applied 224 place count 305 transition count 382
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 249 place count 280 transition count 357
Iterating global reduction 0 with 25 rules applied. Total rules applied 274 place count 280 transition count 357
Applied a total of 274 rules in 132 ms. Remains 280 /417 variables (removed 137) and now considering 357/494 (removed 137) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17776448547510735506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18230361261874842522.kers'
[2026-05-22 20:35:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17776448547510735506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18230361261874842522.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 357 rows 280 cols 832 entries
Finished phase 1 with 269 SingleSign rule and 0 generalized
[2026-05-22 20:35:36] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18230361261874842522.kers
Total runtime 5 ms.
[2026-05-22 20:35:36] [INFO ] Implicit Places using invariants in 572 ms returned []
[2026-05-22 20:35:36] [INFO ] Invariant cache hit.
[2026-05-22 20:35:37] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2026-05-22 20:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (OVERLAPS) 357/637 variables, 280/294 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 637/637 variables, and 294 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (OVERLAPS) 357/637 variables, 280/294 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 356/650 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/637 variables, and 652 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Starting structural reductions in LTL mode, iteration 1 : 280/417 places, 357/494 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61641 ms. Remains : 280/417 places, 357/494 transitions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Applied a total of 0 rules in 14 ms. Remains 280 /280 variables (removed 0) and now considering 357/357 (removed 0) transitions.
[2026-05-22 20:36:37] [INFO ] Invariant cache hit.
[2026-05-22 20:36:38] [INFO ] Implicit Places using invariants in 379 ms returned []
[2026-05-22 20:36:38] [INFO ] Invariant cache hit.
[2026-05-22 20:36:38] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 772 ms. Remains : 280/280 places, 357/357 transitions.
Support contains 31 out of 280 places after structural reductions.
[2026-05-22 20:36:38] [INFO ] Flatten gal took : 77 ms
[2026-05-22 20:36:38] [INFO ] Flatten gal took : 31 ms
[2026-05-22 20:36:39] [INFO ] Input system was already deterministic with 357 transitions.
RANDOM walk for 37291 steps (127 resets) in 1948 ms. (19 steps per ms) remains 0/31 properties
Computed a total of 17 stabilizing places and 17 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((p0 U (p1||G((p2||(p3 U (p4||G(p3))))))))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 266 transition count 343
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 266 transition count 343
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 258 transition count 335
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 258 transition count 335
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 253 transition count 330
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 253 transition count 330
Applied a total of 54 rules in 25 ms. Remains 253 /280 variables (removed 27) and now considering 330/357 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11043958422799628298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5646312108441914309.kers'
[2026-05-22 20:36:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11043958422799628298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5646312108441914309.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 330 rows 253 cols 778 entries
Finished phase 1 with 242 SingleSign rule and 0 generalized
[2026-05-22 20:36:40] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5646312108441914309.kers
Total runtime 2 ms.
[2026-05-22 20:36:40] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-22 20:36:40] [INFO ] Invariant cache hit.
[2026-05-22 20:36:40] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2026-05-22 20:36:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 330/583 variables, 253/266 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/583 variables, and 266 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 330/583 variables, 253/266 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 329/595 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 598 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 253/280 places, 330/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60642 ms. Remains : 253/280 places, 330/357 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((p0 U (G((p1||(p2 U (p3||G(p2)))))||p4)))))'
Stuttering acceptance computed with spot in 712 ms :[(AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), true, (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-03
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 4 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLFireability-03 finished in 61501 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)))'
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Graph (trivial) has 300 edges and 280 vertex of which 184 / 280 are part of one of the 11 SCC in 5 ms
Free SCC test removed 173 places
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 106 transition count 126
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 51 rules applied. Total rules applied 87 place count 71 transition count 110
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 64 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 63 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 96 place count 63 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 62 transition count 108
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 108 place count 52 transition count 84
Iterating global reduction 4 with 10 rules applied. Total rules applied 118 place count 52 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 124 place count 52 transition count 78
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 160 place count 34 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 32 transition count 58
Applied a total of 162 rules in 74 ms. Remains 32 /280 variables (removed 248) and now considering 58/357 (removed 299) transitions.
[2026-05-22 20:37:41] [INFO ] Flow matrix only has 32 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15554707403148248540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14437216240887084399.kers'
[2026-05-22 20:37:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15554707403148248540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14437216240887084399.kers]
Normalized transition count is 31 out of 32 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 31 rows 28 cols 74 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-22 20:37:41] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14437216240887084399.kers
Total runtime 1 ms.
[2026-05-22 20:37:41] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-22 20:37:41] [INFO ] Flow matrix only has 32 transitions (discarded 26 similar events)
[2026-05-22 20:37:41] [INFO ] Invariant cache hit.
[2026-05-22 20:37:42] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2026-05-22 20:37:42] [INFO ] Redundant transitions in 2 ms returned []
Running 28 sub problems to find dead transitions.
[2026-05-22 20:37:42] [INFO ] Flow matrix only has 32 transitions (discarded 26 similar events)
[2026-05-22 20:37:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 31/63 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 43 constraints, problems are : Problem set: 0 solved, 28 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 31/63 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 71 constraints, problems are : Problem set: 0 solved, 28 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1857ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1858ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/280 places, 58/357 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2093 ms. Remains : 32/280 places, 58/357 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)))'
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-04
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLFireability-04 finished in 2193 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 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Graph (trivial) has 298 edges and 280 vertex of which 182 / 280 are part of one of the 11 SCC in 2 ms
Free SCC test removed 171 places
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 108 transition count 126
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 53 rules applied. Total rules applied 91 place count 71 transition count 110
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 98 place count 64 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 98 place count 64 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 63 transition count 109
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 109 place count 54 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 118 place count 54 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 122 place count 54 transition count 85
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 156 place count 37 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 36 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 36 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 36 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 35 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 165 place count 35 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 33 transition count 62
Applied a total of 167 rules in 57 ms. Remains 33 /280 variables (removed 247) and now considering 62/357 (removed 295) transitions.
[2026-05-22 20:37:44] [INFO ] Flow matrix only has 34 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7188880793552609634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14031832008291938415.kers'
[2026-05-22 20:37:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7188880793552609634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14031832008291938415.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 33 rows 29 cols 78 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-22 20:37:44] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14031832008291938415.kers
Total runtime 2 ms.
[2026-05-22 20:37:44] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-22 20:37:44] [INFO ] Flow matrix only has 34 transitions (discarded 28 similar events)
[2026-05-22 20:37:44] [INFO ] Invariant cache hit.
[2026-05-22 20:37:44] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2026-05-22 20:37:44] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-22 20:37:44] [INFO ] Flow matrix only has 34 transitions (discarded 28 similar events)
[2026-05-22 20:37:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 33/66 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/67 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 33/66 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 30/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/67 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1995ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1996ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/280 places, 62/357 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2244 ms. Remains : 33/280 places, 62/357 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 51 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLFireability-05 finished in 2333 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(p0)))&&F(p1)&&F(p2)))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 266 transition count 343
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 266 transition count 343
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 259 transition count 336
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 259 transition count 336
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 255 transition count 332
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 255 transition count 332
Applied a total of 50 rules in 30 ms. Remains 255 /280 variables (removed 25) and now considering 332/357 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11137726763169959574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3063391410302932708.kers'
[2026-05-22 20:37:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11137726763169959574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3063391410302932708.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 332 rows 255 cols 782 entries
Finished phase 1 with 244 SingleSign rule and 0 generalized
[2026-05-22 20:37:46] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3063391410302932708.kers
Total runtime 4 ms.
[2026-05-22 20:37:46] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-22 20:37:46] [INFO ] Invariant cache hit.
[2026-05-22 20:37:46] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2026-05-22 20:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/255 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 332/587 variables, 255/266 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 587/587 variables, and 266 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/255 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 332/587 variables, 255/266 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 331/597 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/587 variables, and 598 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 255/280 places, 332/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60517 ms. Remains : 255/280 places, 332/357 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(p0)))&&F(p1)&&F(p2)))'
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-06
Stuttering criterion allowed to conclude after 834 steps with 4 reset in 16 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLFireability-06 finished in 60952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(F(p1))) U X(p2)))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 267 transition count 344
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 267 transition count 344
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 259 transition count 336
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 259 transition count 336
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 254 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 254 transition count 331
Applied a total of 52 rules in 28 ms. Remains 254 /280 variables (removed 26) and now considering 331/357 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3941925993019616325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13846860336559174554.kers'
[2026-05-22 20:38:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3941925993019616325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13846860336559174554.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 331 rows 254 cols 780 entries
Finished phase 1 with 243 SingleSign rule and 0 generalized
[2026-05-22 20:38:47] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13846860336559174554.kers
Total runtime 3 ms.
[2026-05-22 20:38:47] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-22 20:38:47] [INFO ] Invariant cache hit.
[2026-05-22 20:38:47] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2026-05-22 20:38:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 331/585 variables, 254/265 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/585 variables, and 265 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 331/585 variables, 254/265 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 330/595 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 597 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 254/280 places, 331/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60650 ms. Remains : 254/280 places, 331/357 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(F(p1))) U X(p2)))'
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-07
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLFireability-07 finished in 60936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Graph (trivial) has 298 edges and 280 vertex of which 181 / 280 are part of one of the 11 SCC in 1 ms
Free SCC test removed 170 places
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 109 transition count 126
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 53 rules applied. Total rules applied 92 place count 71 transition count 111
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 99 place count 64 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 99 place count 64 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 63 transition count 110
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 110 place count 54 transition count 90
Iterating global reduction 3 with 9 rules applied. Total rules applied 119 place count 54 transition count 90
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 124 place count 54 transition count 85
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 156 place count 38 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 37 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 37 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 36 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 36 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 34 transition count 64
Applied a total of 166 rules in 43 ms. Remains 34 /280 variables (removed 246) and now considering 64/357 (removed 293) transitions.
[2026-05-22 20:39:48] [INFO ] Flow matrix only has 40 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12012845200589662967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3769618432441058056.kers'
[2026-05-22 20:39:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12012845200589662967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3769618432441058056.kers]
Normalized transition count is 39 out of 40 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 39 rows 31 cols 100 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-22 20:39:48] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3769618432441058056.kers
Total runtime 1 ms.
[2026-05-22 20:39:48] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-22 20:39:48] [INFO ] Flow matrix only has 40 transitions (discarded 24 similar events)
[2026-05-22 20:39:48] [INFO ] Invariant cache hit.
[2026-05-22 20:39:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:39:48] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2026-05-22 20:39:48] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2026-05-22 20:39:48] [INFO ] Flow matrix only has 40 transitions (discarded 24 similar events)
[2026-05-22 20:39:48] [INFO ] Invariant cache hit.
[2026-05-22 20:39:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 39/73 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/74 variables, and 46 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1156 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 39/73 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 33/79 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/74 variables, and 79 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2300ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2302ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/280 places, 64/357 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2508 ms. Remains : 34/280 places, 64/357 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLFireability-08 finished in 2626 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(X(X(F(p1)))))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Graph (trivial) has 299 edges and 280 vertex of which 184 / 280 are part of one of the 11 SCC in 1 ms
Free SCC test removed 173 places
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 106 transition count 126
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 51 rules applied. Total rules applied 87 place count 71 transition count 110
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 64 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 63 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 96 place count 63 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 62 transition count 108
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 106 place count 54 transition count 86
Iterating global reduction 4 with 8 rules applied. Total rules applied 114 place count 54 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 120 place count 54 transition count 80
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 154 place count 37 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 36 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 36 transition count 62
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 35 transition count 60
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 35 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 35 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 33 transition count 57
Applied a total of 163 rules in 38 ms. Remains 33 /280 variables (removed 247) and now considering 57/357 (removed 300) transitions.
[2026-05-22 20:39:50] [INFO ] Flow matrix only has 32 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9158283041560941995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17369252995898353868.kers'
[2026-05-22 20:39:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9158283041560941995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17369252995898353868.kers]
Normalized transition count is 31 out of 32 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 31 rows 32 cols 82 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-22 20:39:50] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17369252995898353868.kers
Total runtime 9 ms.
[2026-05-22 20:39:50] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-22 20:39:50] [INFO ] Flow matrix only has 32 transitions (discarded 25 similar events)
[2026-05-22 20:39:50] [INFO ] Invariant cache hit.
[2026-05-22 20:39:51] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2026-05-22 20:39:51] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2026-05-22 20:39:51] [INFO ] Flow matrix only has 32 transitions (discarded 25 similar events)
[2026-05-22 20:39:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 3/33 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 31/64 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/64 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/65 variables, and 44 constraints, problems are : Problem set: 0 solved, 32 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 3/33 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 31/64 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/65 variables, and 77 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1246 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2069ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/280 places, 57/357 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2270 ms. Remains : 33/280 places, 57/357 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)||X(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLFireability-10 finished in 2526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1 U p2)) U X(X((p1&&X((p1 U (p3||G(p1)))))))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 268 transition count 345
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 268 transition count 345
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 261 transition count 338
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 261 transition count 338
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 257 transition count 334
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 257 transition count 334
Applied a total of 46 rules in 21 ms. Remains 257 /280 variables (removed 23) and now considering 334/357 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1445045538802408780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16070736294252526064.kers'
[2026-05-22 20:39:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1445045538802408780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16070736294252526064.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 334 rows 257 cols 786 entries
Finished phase 1 with 246 SingleSign rule and 0 generalized
[2026-05-22 20:39:53] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16070736294252526064.kers
Total runtime 3 ms.
[2026-05-22 20:39:53] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-22 20:39:53] [INFO ] Invariant cache hit.
[2026-05-22 20:39:53] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2026-05-22 20:39:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (OVERLAPS) 334/591 variables, 257/268 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 268 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (OVERLAPS) 334/591 variables, 257/268 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 333/601 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 602 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 257/280 places, 334/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60618 ms. Remains : 257/280 places, 334/357 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1 U p2)) U X(X((p1&&X((p1 U (p3||G(p1)))))))))'
Stuttering acceptance computed with spot in 1490 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p3) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLFireability-11 finished in 62248 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)) U G(p1)) U p2) U (p3&&F(p4))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Graph (trivial) has 290 edges and 280 vertex of which 166 / 280 are part of one of the 10 SCC in 2 ms
Free SCC test removed 156 places
Ensure Unique test removed 177 transitions
Reduce isomorphic transitions removed 177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 123 transition count 137
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 56 rules applied. Total rules applied 99 place count 81 transition count 123
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 106 place count 75 transition count 122
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 3 with 3 rules applied. Total rules applied 109 place count 74 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 73 transition count 120
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 110 place count 73 transition count 115
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 120 place count 68 transition count 115
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 127 place count 61 transition count 99
Iterating global reduction 5 with 7 rules applied. Total rules applied 134 place count 61 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 138 place count 61 transition count 95
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 170 place count 45 transition count 79
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 171 place count 44 transition count 77
Iterating global reduction 6 with 1 rules applied. Total rules applied 172 place count 44 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 173 place count 44 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 179 place count 41 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 180 place count 41 transition count 83
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 181 place count 40 transition count 75
Iterating global reduction 8 with 1 rules applied. Total rules applied 182 place count 40 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 183 place count 40 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 189 place count 40 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 191 place count 38 transition count 66
Applied a total of 191 rules in 48 ms. Remains 38 /280 variables (removed 242) and now considering 66/357 (removed 291) transitions.
[2026-05-22 20:40:55] [INFO ] Flow matrix only has 48 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4407357423772704117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15920239359940532222.kers'
[2026-05-22 20:40:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4407357423772704117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15920239359940532222.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 47 rows 35 cols 124 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-22 20:40:55] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15920239359940532222.kers
Total runtime 1 ms.
[2026-05-22 20:40:55] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-22 20:40:55] [INFO ] Flow matrix only has 48 transitions (discarded 18 similar events)
[2026-05-22 20:40:55] [INFO ] Invariant cache hit.
[2026-05-22 20:40:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:40:55] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2026-05-22 20:40:55] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2026-05-22 20:40:55] [INFO ] Flow matrix only has 48 transitions (discarded 18 similar events)
[2026-05-22 20:40:55] [INFO ] Invariant cache hit.
[2026-05-22 20:40:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 47/85 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 50 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1359 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 47/85 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 39/89 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/86 variables, and 89 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1403 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2770ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2770ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/280 places, 66/357 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3017 ms. Remains : 38/280 places, 66/357 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)) U G(p1)) U p2) U (p3&&F(p4))))'
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p3) (NOT p4)), (NOT p0), (AND (NOT p0) p1), (NOT p1), (NOT p2), (NOT p4)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLFireability-13 finished in 3453 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)||X((p1||F(G(p2))))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 266 transition count 343
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 266 transition count 343
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 258 transition count 335
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 258 transition count 335
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 253 transition count 330
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 253 transition count 330
Applied a total of 54 rules in 21 ms. Remains 253 /280 variables (removed 27) and now considering 330/357 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10571202098929697336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8730572225894185297.kers'
[2026-05-22 20:40:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10571202098929697336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8730572225894185297.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 330 rows 253 cols 778 entries
Finished phase 1 with 242 SingleSign rule and 0 generalized
[2026-05-22 20:40:59] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8730572225894185297.kers
Total runtime 4 ms.
[2026-05-22 20:40:59] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-22 20:40:59] [INFO ] Invariant cache hit.
[2026-05-22 20:40:59] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2026-05-22 20:40:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 330/583 variables, 253/264 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/583 variables, and 264 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 330/583 variables, 253/264 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 329/593 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 594 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 253/280 places, 330/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60591 ms. Remains : 253/280 places, 330/357 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)||X((p1||F(G(p2))))))'
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 448 ms.
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 18 ms. Proved property starting from automaton with 3 states, 4 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 29 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H04T2O-LTLFireability-14 finished in 61539 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(p0))))&&F(p1))))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 357/357 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 266 transition count 343
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 266 transition count 343
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 258 transition count 335
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 258 transition count 335
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 253 transition count 330
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 253 transition count 330
Applied a total of 54 rules in 20 ms. Remains 253 /280 variables (removed 27) and now considering 330/357 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8986390969546202417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7911464971561000141.kers'
[2026-05-22 20:42:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8986390969546202417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7911464971561000141.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 330 rows 253 cols 778 entries
Finished phase 1 with 242 SingleSign rule and 0 generalized
[2026-05-22 20:42:00] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7911464971561000141.kers
Total runtime 3 ms.
[2026-05-22 20:42:00] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-22 20:42:00] [INFO ] Invariant cache hit.
[2026-05-22 20:42:01] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 253/280 places, 330/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 253/280 places, 330/357 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(p0))))&&F(p1))))'
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : Champagne-PT-H04T2O-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T2O-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLFireability-15 finished in 780 ms.
All properties solved by simple procedures.
Total runtime 385913 ms.
BK_STOP 1779482521476
--------------------
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="Champagne-PT-H04T2O"
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 Champagne-PT-H04T2O, 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 r050-smll-177946901000020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H04T2O.tgz
mv Champagne-PT-H04T2O execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;