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-177946901000076.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-H07T0R, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.9K Mar 6 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 6 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 6 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:59 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 169K 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-H07T0R-LTLFireability-00
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-01
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-02
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-03
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-04
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-05
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-06
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-07
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-08
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-09
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-10
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-11
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-12
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-13
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-14
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779501121153

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-H07T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 01:52:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 01:52:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 01:52:04] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2026-05-23 01:52:04] [INFO ] Transformed 539 places.
[2026-05-23 01:52:04] [INFO ] Transformed 742 transitions.
[2026-05-23 01:52:04] [INFO ] Found NUPN structural information;
[2026-05-23 01:52:04] [INFO ] Parsed PT model containing 539 places and 742 transitions and 1934 arcs in 523 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H07T0R-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 742/742 transitions.
Discarding 125 places :
Symmetric choice reduction at 0 with 125 rule applications. Total rules 125 place count 414 transition count 617
Iterating global reduction 0 with 125 rules applied. Total rules applied 250 place count 414 transition count 617
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 322 place count 342 transition count 545
Iterating global reduction 0 with 72 rules applied. Total rules applied 394 place count 342 transition count 545
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 436 place count 300 transition count 468
Iterating global reduction 0 with 42 rules applied. Total rules applied 478 place count 300 transition count 468
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 494 place count 300 transition count 452
Applied a total of 494 rules in 228 ms. Remains 300 /539 variables (removed 239) and now considering 452/742 (removed 290) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12618326895043447388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1139163924358431435.kers'
[2026-05-23 01:52:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12618326895043447388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1139163924358431435.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 452 rows 300 cols 1262 entries
Finished phase 1 with 273 SingleSign rule and 0 generalized
[2026-05-23 01:52:05] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1139163924358431435.kers
Total runtime 7 ms.
[2026-05-23 01:52:05] [INFO ] Implicit Places using invariants in 670 ms returned []
[2026-05-23 01:52:05] [INFO ] Invariant cache hit.
[2026-05-23 01:52:06] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1484 ms to find 0 implicit places.
Running 451 sub problems to find dead transitions.
[2026-05-23 01:52:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 451 unsolved
SMT process timed out in 30324ms, After SMT, problems are : Problem set: 0 solved, 451 unsolved
Search for dead transitions found 0 dead transitions in 30361ms
Starting structural reductions in LTL mode, iteration 1 : 300/539 places, 452/742 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32149 ms. Remains : 300/539 places, 452/742 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Applied a total of 0 rules in 14 ms. Remains 300 /300 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2026-05-23 01:52:36] [INFO ] Invariant cache hit.
[2026-05-23 01:52:37] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-23 01:52:37] [INFO ] Invariant cache hit.
[2026-05-23 01:52:37] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 300/300 places, 452/452 transitions.
Support contains 43 out of 300 places after structural reductions.
[2026-05-23 01:52:38] [INFO ] Flatten gal took : 127 ms
[2026-05-23 01:52:38] [INFO ] Flatten gal took : 66 ms
[2026-05-23 01:52:38] [INFO ] Input system was already deterministic with 452 transitions.
RANDOM walk for 40000 steps (132 resets) in 2410 ms. (16 steps per ms) remains 2/38 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
[2026-05-23 01:52:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 34/752 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 2/27 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Champagne-PT-H07T0R-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Champagne-PT-H07T0R-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Champagne-PT-H07T0R-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Champagne-PT-H07T0R-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 41 stabilizing places and 41 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' '!(F((F(p0)&&X(p1))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 279 transition count 405
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 279 transition count 405
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 279 transition count 398
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 270 transition count 389
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 270 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 270 transition count 388
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 263 transition count 372
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 263 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 263 transition count 370
Applied a total of 84 rules in 51 ms. Remains 263 /300 variables (removed 37) and now considering 370/452 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6306579575092748655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10635103524782433551.kers'
[2026-05-23 01:52:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6306579575092748655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10635103524782433551.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 263 cols 1012 entries
Finished phase 1 with 236 SingleSign rule and 0 generalized
[2026-05-23 01:52:40] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10635103524782433551.kers
Total runtime 4 ms.
[2026-05-23 01:52:40] [INFO ] Implicit Places using invariants in 221 ms returned []
[2026-05-23 01:52:40] [INFO ] Invariant cache hit.
[2026-05-23 01:52:40] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2026-05-23 01:52:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/633 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/633 variables, and 290 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/633 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 369/659 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/633 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/633 variables, and 660 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 263/300 places, 370/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60944 ms. Remains : 263/300 places, 370/452 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((F(p0)&&X(p1))))'
Stuttering acceptance computed with spot in 473 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-00
Stuttering criterion allowed to conclude after 766 steps with 32 reset in 20 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-00 finished in 61669 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||F(!p1))) U (X(!p2)&&F(p3))))'
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 281 transition count 411
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 281 transition count 411
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 281 transition count 405
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 273 transition count 397
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 273 transition count 397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 273 transition count 396
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 267 transition count 381
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 267 transition count 381
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 267 transition count 379
Applied a total of 75 rules in 38 ms. Remains 267 /300 variables (removed 33) and now considering 379/452 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4844680469694581799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15779465535605128396.kers'
[2026-05-23 01:53:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4844680469694581799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15779465535605128396.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 267 cols 1040 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-05-23 01:53:41] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15779465535605128396.kers
Total runtime 4 ms.
[2026-05-23 01:53:41] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-23 01:53:41] [INFO ] Invariant cache hit.
[2026-05-23 01:53:42] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2026-05-23 01:53:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (OVERLAPS) 379/646 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 294 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (OVERLAPS) 379/646 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/646 variables, 378/672 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 673 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 267/300 places, 379/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60851 ms. Remains : 267/300 places, 379/452 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||F(!p1))) U (X(!p2)&&F(p3))))'
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p3) p2), p2, (NOT p3), (AND (NOT p0) p1 p2), p1, (AND p1 p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-01
Stuttering criterion allowed to conclude after 288 steps with 2 reset in 3 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-01 finished in 61272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((G(p1)||(p2 U p3)))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 281 transition count 404
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 281 transition count 404
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 46 place count 281 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 274 transition count 389
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 274 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 274 transition count 388
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 269 transition count 383
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 269 transition count 383
Applied a total of 71 rules in 26 ms. Remains 269 /300 variables (removed 31) and now considering 383/452 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5164459108076530521.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18429340670293329782.kers'
[2026-05-23 01:54:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5164459108076530521.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18429340670293329782.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 383 rows 269 cols 1052 entries
Finished phase 1 with 242 SingleSign rule and 0 generalized
[2026-05-23 01:54:42] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18429340670293329782.kers
Total runtime 4 ms.
[2026-05-23 01:54:43] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-23 01:54:43] [INFO ] Invariant cache hit.
[2026-05-23 01:54:43] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2026-05-23 01:54:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (OVERLAPS) 383/652 variables, 269/296 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 652/652 variables, and 296 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (OVERLAPS) 383/652 variables, 269/296 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/652 variables, 382/678 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/652 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 652/652 variables, and 679 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 269/300 places, 383/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60827 ms. Remains : 269/300 places, 383/452 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((G(p1)||(p2 U p3)))))'
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-02
Product exploration explored 100000 steps with 1881 reset in 571 ms.
Stack based approach found an accepted trace after 2218 steps with 40 reset with depth 21 and stack size 21 in 14 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-02 finished in 61585 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(((p0&&G(p1)) U p2))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 279 transition count 402
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 279 transition count 402
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 50 place count 279 transition count 394
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 271 transition count 386
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 271 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 271 transition count 385
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 265 transition count 370
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 265 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 265 transition count 368
Applied a total of 81 rules in 24 ms. Remains 265 /300 variables (removed 35) and now considering 368/452 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13187590552674409694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-330140735095378613.kers'
[2026-05-23 01:55:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13187590552674409694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-330140735095378613.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 265 cols 1000 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-05-23 01:55:44] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-330140735095378613.kers
Total runtime 4 ms.
[2026-05-23 01:55:44] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-23 01:55:44] [INFO ] Invariant cache hit.
[2026-05-23 01:55:45] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-23 01:55:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 368/633 variables, 265/292 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/633 variables, and 292 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 368/633 variables, 265/292 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 367/659 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/633 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/633 variables, and 661 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 265/300 places, 368/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60807 ms. Remains : 265/300 places, 368/452 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&&G(p1)) U p2))))'
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-04 finished in 61081 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((F((p0&&G(p1)))&&(p0 U X(p2))&&X(p3))))'
Support contains 5 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 280 transition count 409
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 280 transition count 409
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 280 transition count 402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 273 transition count 395
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 273 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 273 transition count 394
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 267 transition count 379
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 267 transition count 379
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 267 transition count 377
Applied a total of 76 rules in 23 ms. Remains 267 /300 variables (removed 33) and now considering 377/452 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2448796090772326683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9066639316925931392.kers'
[2026-05-23 01:56:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2448796090772326683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9066639316925931392.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 377 rows 267 cols 1032 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-05-23 01:56:45] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9066639316925931392.kers
Total runtime 3 ms.
[2026-05-23 01:56:45] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-23 01:56:45] [INFO ] Invariant cache hit.
[2026-05-23 01:56:46] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2026-05-23 01:56:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (OVERLAPS) 377/644 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 644/644 variables, and 294 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (OVERLAPS) 377/644 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 376/670 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 644/644 variables, and 672 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 267/300 places, 377/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60653 ms. Remains : 267/300 places, 377/452 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((F((p0&&G(p1)))&&(p0 U X(p2))&&X(p3))))'
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p3), (NOT p2), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-06
Stuttering criterion allowed to conclude after 234 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-06 finished in 61118 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||F(p1)) U X(X(X((p2&&X(p3)))))))'
Support contains 5 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 282 transition count 411
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 282 transition count 411
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 43 place count 282 transition count 404
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 274 transition count 396
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 274 transition count 396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 274 transition count 395
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 268 transition count 380
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 268 transition count 380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 268 transition count 378
Applied a total of 74 rules in 20 ms. Remains 268 /300 variables (removed 32) and now considering 378/452 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14859414339942025551.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3362283332409851931.kers'
[2026-05-23 01:57:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14859414339942025551.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3362283332409851931.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 378 rows 268 cols 1034 entries
Finished phase 1 with 241 SingleSign rule and 0 generalized
[2026-05-23 01:57:46] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3362283332409851931.kers
Total runtime 4 ms.
[2026-05-23 01:57:46] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-23 01:57:46] [INFO ] Invariant cache hit.
[2026-05-23 01:57:47] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2026-05-23 01:57:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 378/646 variables, 268/295 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 295 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 378/646 variables, 268/295 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/646 variables, 377/672 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 674 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 268/300 places, 378/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60791 ms. Remains : 268/300 places, 378/452 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)||p1) U X(X(X((p2&&X(p3)))))))'
Stuttering acceptance computed with spot in 856 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-08
Product exploration explored 100000 steps with 20000 reset in 268 ms.
Product exploration explored 100000 steps with 20000 reset in 253 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Detected a total of 30/268 stabilizing places and 30/378 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 9 factoid took 260 ms. Reduced automaton from 16 states, 31 edges and 4 AP (stutter sensitive) to 13 states, 26 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (146 resets) in 281 ms. (141 steps per ms) remains 1/15 properties
BEST_FIRST walk for 15852 steps (2 resets) in 67 ms. (233 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 847 ms. Reduced automaton from 13 states, 26 edges and 4 AP (stutter sensitive) to 13 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 666 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3)]
Knowledge-based reduction took 1912 ms.
Stuttering acceptance computed with spot in 664 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3)]
Support contains 5 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 378/378 transitions.
Applied a total of 0 rules in 5 ms. Remains 268 /268 variables (removed 0) and now considering 378/378 (removed 0) transitions.
[2026-05-23 01:58:51] [INFO ] Invariant cache hit.
[2026-05-23 01:58:51] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-23 01:58:51] [INFO ] Invariant cache hit.
[2026-05-23 01:58:52] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 268/268 places, 378/378 transitions.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Detected a total of 30/268 stabilizing places and 30/378 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 13 states, 26 edges and 4 AP (stutter sensitive) to 13 states, 26 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (144 resets) in 301 ms. (132 steps per ms) remains 1/15 properties
BEST_FIRST walk for 28289 steps (6 resets) in 80 ms. (349 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 790 ms. Reduced automaton from 13 states, 26 edges and 4 AP (stutter sensitive) to 13 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 682 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3)]
Knowledge-based reduction took 1818 ms.
Stuttering acceptance computed with spot in 709 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 686 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 20000 reset in 123 ms.
Product exploration explored 100000 steps with 20000 reset in 144 ms.
Spot run failed in 165 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin16259218277999663405
[2026-05-23 01:58:55] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16259218277999663405
Running compilation step : cd /tmp/ltsmin16259218277999663405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1059 ms.
Running link step : cd /tmp/ltsmin16259218277999663405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin16259218277999663405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14743265369589075294.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H07T0R-LTLFireability-08 finished in 70415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Graph (trivial) has 280 edges and 300 vertex of which 45 / 300 are part of one of the 9 SCC in 4 ms
Free SCC test removed 36 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 263 transition count 363
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 97 rules applied. Total rules applied 146 place count 215 transition count 314
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 170 place count 191 transition count 314
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 170 place count 191 transition count 302
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 194 place count 179 transition count 302
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 211 place count 162 transition count 256
Iterating global reduction 3 with 17 rules applied. Total rules applied 228 place count 162 transition count 256
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 235 place count 162 transition count 249
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 235 place count 162 transition count 243
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 247 place count 156 transition count 243
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 401 place count 79 transition count 166
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 403 place count 77 transition count 155
Iterating global reduction 4 with 2 rules applied. Total rules applied 405 place count 77 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 407 place count 77 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 409 place count 75 transition count 151
Applied a total of 409 rules in 85 ms. Remains 75 /300 variables (removed 225) and now considering 151/452 (removed 301) transitions.
[2026-05-23 01:58:57] [INFO ] Flow matrix only has 72 transitions (discarded 79 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6966136670161388567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8889044148623057698.kers'
[2026-05-23 01:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6966136670161388567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8889044148623057698.kers]
Normalized transition count is 71 out of 72 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 71 rows 68 cols 184 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-23 01:58:57] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8889044148623057698.kers
Total runtime 2 ms.
[2026-05-23 01:58:57] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-23 01:58:57] [INFO ] Flow matrix only has 72 transitions (discarded 79 similar events)
[2026-05-23 01:58:57] [INFO ] Invariant cache hit.
[2026-05-23 01:58:57] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2026-05-23 01:58:57] [INFO ] Redundant transitions in 13 ms returned []
Running 96 sub problems to find dead transitions.
[2026-05-23 01:58:57] [INFO ] Flow matrix only has 72 transitions (discarded 79 similar events)
[2026-05-23 01:58:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 71/146 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 102 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3584 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 71/146 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 96/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 198 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4730 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8337ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8338ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/300 places, 151/452 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8725 ms. Remains : 75/300 places, 151/452 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-09 finished in 8864 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 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Graph (trivial) has 283 edges and 300 vertex of which 44 / 300 are part of one of the 9 SCC in 2 ms
Free SCC test removed 35 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 264 transition count 364
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 98 rules applied. Total rules applied 148 place count 215 transition count 315
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 172 place count 191 transition count 315
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 172 place count 191 transition count 304
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 194 place count 180 transition count 304
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 211 place count 163 transition count 258
Iterating global reduction 3 with 17 rules applied. Total rules applied 228 place count 163 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 235 place count 163 transition count 251
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 235 place count 163 transition count 244
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 249 place count 156 transition count 244
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 403 place count 79 transition count 167
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 405 place count 77 transition count 156
Iterating global reduction 4 with 2 rules applied. Total rules applied 407 place count 77 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 409 place count 77 transition count 154
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 411 place count 75 transition count 152
Applied a total of 411 rules in 102 ms. Remains 75 /300 variables (removed 225) and now considering 152/452 (removed 300) transitions.
[2026-05-23 01:59:05] [INFO ] Flow matrix only has 71 transitions (discarded 81 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6914202690221091884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3600166133782036099.kers'
[2026-05-23 01:59:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6914202690221091884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3600166133782036099.kers]
Normalized transition count is 70 out of 71 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 70 rows 69 cols 180 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-23 01:59:05] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3600166133782036099.kers
Total runtime 5 ms.
[2026-05-23 01:59:06] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-23 01:59:06] [INFO ] Flow matrix only has 71 transitions (discarded 81 similar events)
[2026-05-23 01:59:06] [INFO ] Invariant cache hit.
[2026-05-23 01:59:06] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2026-05-23 01:59:06] [INFO ] Redundant transitions in 8 ms returned []
Running 95 sub problems to find dead transitions.
[2026-05-23 01:59:06] [INFO ] Flow matrix only has 71 transitions (discarded 81 similar events)
[2026-05-23 01:59:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 70/145 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/145 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/146 variables, and 102 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4270 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 70/145 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 95/197 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/146 variables, and 197 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4588 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8876ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 8877ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/300 places, 152/452 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9357 ms. Remains : 75/300 places, 152/452 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 50 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-10
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-10 finished in 9445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1&&F(p2))))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Graph (trivial) has 277 edges and 300 vertex of which 45 / 300 are part of one of the 9 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 263 transition count 365
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 94 rules applied. Total rules applied 141 place count 217 transition count 317
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 164 place count 194 transition count 317
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 164 place count 194 transition count 305
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 188 place count 182 transition count 305
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 203 place count 167 transition count 261
Iterating global reduction 3 with 15 rules applied. Total rules applied 218 place count 167 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 225 place count 167 transition count 254
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 225 place count 167 transition count 248
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 237 place count 161 transition count 248
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 393 place count 83 transition count 170
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 395 place count 81 transition count 159
Iterating global reduction 4 with 2 rules applied. Total rules applied 397 place count 81 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 399 place count 81 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 401 place count 79 transition count 155
Applied a total of 401 rules in 73 ms. Remains 79 /300 variables (removed 221) and now considering 155/452 (removed 297) transitions.
[2026-05-23 01:59:15] [INFO ] Flow matrix only has 80 transitions (discarded 75 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-160705674927789938.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-406176590359677665.kers'
[2026-05-23 01:59:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-160705674927789938.kers, --Pflows, --basisKERS=/tmp/petrispot-output-406176590359677665.kers]
Normalized transition count is 79 out of 80 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 79 rows 72 cols 208 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-23 01:59:15] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-406176590359677665.kers
Total runtime 1 ms.
[2026-05-23 01:59:15] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-23 01:59:15] [INFO ] Flow matrix only has 80 transitions (discarded 75 similar events)
[2026-05-23 01:59:15] [INFO ] Invariant cache hit.
[2026-05-23 01:59:15] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2026-05-23 01:59:15] [INFO ] Redundant transitions in 8 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-23 01:59:15] [INFO ] Flow matrix only has 80 transitions (discarded 75 similar events)
[2026-05-23 01:59:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 4/79 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 79/158 variables, 79/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/158 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/159 variables, and 106 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5159 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 4/79 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 79/158 variables, 79/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/158 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/159 variables, and 207 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5201 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10377ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 10378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 79/300 places, 155/452 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10829 ms. Remains : 79/300 places, 155/452 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1&&F(p2))))))'
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-12 finished in 11045 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)))||G(p1)))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 278 transition count 401
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 278 transition count 401
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 52 place count 278 transition count 393
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 269 transition count 384
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 269 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 269 transition count 383
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 78 place count 262 transition count 367
Iterating global reduction 2 with 7 rules applied. Total rules applied 85 place count 262 transition count 367
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 262 transition count 365
Applied a total of 87 rules in 29 ms. Remains 262 /300 variables (removed 38) and now considering 365/452 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-70497703064590251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3223517814940729017.kers'
[2026-05-23 01:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-70497703064590251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3223517814940729017.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 262 cols 994 entries
Finished phase 1 with 235 SingleSign rule and 0 generalized
[2026-05-23 01:59:26] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3223517814940729017.kers
Total runtime 5 ms.
[2026-05-23 01:59:26] [INFO ] Implicit Places using invariants in 200 ms returned []
[2026-05-23 01:59:26] [INFO ] Invariant cache hit.
[2026-05-23 01:59:27] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-23 01:59:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 365/627 variables, 262/289 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/627 variables, and 289 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 365/627 variables, 262/289 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 364/653 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/627 variables, and 654 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 262/300 places, 365/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60763 ms. Remains : 262/300 places, 365/452 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)))||G(p1)))'
Stuttering acceptance computed with spot in 433 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-13
Entered a terminal (fully accepting) state of product in 39 steps with 9 reset in 1 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-13 finished in 61245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(!(X(p0) U (G(p1) U !p0)))))||p2)))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 452/452 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 280 transition count 409
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 280 transition count 409
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 280 transition count 402
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 272 transition count 394
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 272 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 272 transition count 393
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 266 transition count 378
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 266 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 266 transition count 376
Applied a total of 78 rules in 25 ms. Remains 266 /300 variables (removed 34) and now considering 376/452 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3761473813698074231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12490562106114650563.kers'
[2026-05-23 02:00:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3761473813698074231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12490562106114650563.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 376 rows 266 cols 1030 entries
Finished phase 1 with 239 SingleSign rule and 0 generalized
[2026-05-23 02:00:27] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12490562106114650563.kers
Total runtime 5 ms.
[2026-05-23 02:00:27] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-23 02:00:27] [INFO ] Invariant cache hit.
[2026-05-23 02:00:28] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2026-05-23 02:00:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (OVERLAPS) 376/642 variables, 266/293 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/642 variables, and 293 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (OVERLAPS) 376/642 variables, 266/293 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 375/668 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 672 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 266/300 places, 376/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60762 ms. Remains : 266/300 places, 376/452 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(!(X(p0) U (G(p1) U !p0)))))||p2)))'
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), false, (AND (NOT p0) p1)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-15
Stuttering criterion allowed to conclude after 568 steps with 2 reset in 5 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-15 finished in 61025 ms.
All properties solved by simple procedures.
Total runtime 564903 ms.

BK_STOP 1779501688631

--------------------
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-H07T0R"
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-H07T0R, 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-177946901000076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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