About the Execution of ITS-Tools for Champagne-PT-H05T1U
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 461.180 | 491742.00 | 568938.00 | 1285.10 | FFFFTFFFFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r050-smll-177946901000036.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-H05T1U, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000036
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.5K Mar 6 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 6 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 10:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Mar 6 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 6 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:58 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 108K 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-H05T1U-LTLFireability-00
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-01
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-02
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-03
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-04
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-05
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-06
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-07
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-08
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-09
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-10
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-11
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-12
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-13
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-14
FORMULA_NAME Champagne-PT-H05T1U-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779485636154
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-H05T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 21:33:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 21:33:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:33:58] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2026-05-22 21:33:58] [INFO ] Transformed 389 places.
[2026-05-22 21:33:58] [INFO ] Transformed 491 transitions.
[2026-05-22 21:33:58] [INFO ] Found NUPN structural information;
[2026-05-22 21:33:58] [INFO ] Parsed PT model containing 389 places and 491 transitions and 1176 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H05T1U-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T1U-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T1U-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 491/491 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 310 transition count 412
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 310 transition count 412
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 211 place count 257 transition count 359
Iterating global reduction 0 with 53 rules applied. Total rules applied 264 place count 257 transition count 359
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 291 place count 230 transition count 332
Iterating global reduction 0 with 27 rules applied. Total rules applied 318 place count 230 transition count 332
Applied a total of 318 rules in 186 ms. Remains 230 /389 variables (removed 159) and now considering 332/491 (removed 159) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10798282536117541782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2730591560616967614.kers'
[2026-05-22 21:33:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10798282536117541782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2730591560616967614.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 332 rows 230 cols 858 entries
Finished phase 1 with 215 SingleSign rule and 0 generalized
[2026-05-22 21:33:59] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2730591560616967614.kers
Total runtime 3 ms.
[2026-05-22 21:33:59] [INFO ] Implicit Places using invariants in 486 ms returned []
[2026-05-22 21:33:59] [INFO ] Invariant cache hit.
[2026-05-22 21:34:00] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2026-05-22 21:34:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 332/562 variables, 230/247 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/562 variables, and 247 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 332/562 variables, 230/247 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 331/578 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 585 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Starting structural reductions in LTL mode, iteration 1 : 230/389 places, 332/491 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61459 ms. Remains : 230/389 places, 332/491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 230 /230 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2026-05-22 21:35:00] [INFO ] Invariant cache hit.
[2026-05-22 21:35:00] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-22 21:35:00] [INFO ] Invariant cache hit.
[2026-05-22 21:35:00] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 230/230 places, 332/332 transitions.
Support contains 28 out of 230 places after structural reductions.
[2026-05-22 21:35:01] [INFO ] Flatten gal took : 104 ms
[2026-05-22 21:35:01] [INFO ] Flatten gal took : 56 ms
[2026-05-22 21:35:01] [INFO ] Input system was already deterministic with 332 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (164 resets) in 1410 ms. (28 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40003 steps (17 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
[2026-05-22 21:35:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 209/230 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 332/562 variables, 230/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/562 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 245 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 209/230 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 332/562 variables, 230/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/562 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 246 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 637ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 8 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 14 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((G(p0)&&X(X(X(F(p1)))))))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 218 transition count 320
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 218 transition count 320
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 214 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 214 transition count 316
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 210 transition count 312
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 210 transition count 312
Applied a total of 40 rules in 18 ms. Remains 210 /230 variables (removed 20) and now considering 312/332 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10713019249649420961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5718501106883517128.kers'
[2026-05-22 21:35:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10713019249649420961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5718501106883517128.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 210 cols 818 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-22 21:35:03] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5718501106883517128.kers
Total runtime 2 ms.
[2026-05-22 21:35:03] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-22 21:35:03] [INFO ] Invariant cache hit.
[2026-05-22 21:35:03] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2026-05-22 21:35:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 312/522 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 0/522 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 225 constraints, problems are : Problem set: 0 solved, 311 unsolved in 29360 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 312/522 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 311/536 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 541 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59443ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 59445ms
Starting structural reductions in LTL mode, iteration 1 : 210/230 places, 312/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59878 ms. Remains : 210/230 places, 312/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 482 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-00
Stuttering criterion allowed to conclude after 187 steps with 0 reset in 8 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-00 finished in 60478 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) U (X(G(p0))||(p1&&X((p0&&(p1 U X(p1)))))))))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 217 transition count 319
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 217 transition count 319
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 212 transition count 314
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 212 transition count 314
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 208 transition count 310
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 208 transition count 310
Applied a total of 44 rules in 26 ms. Remains 208 /230 variables (removed 22) and now considering 310/332 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7114637011317806477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9257202853049048333.kers'
[2026-05-22 21:36:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7114637011317806477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9257202853049048333.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 208 cols 814 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-22 21:36:03] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9257202853049048333.kers
Total runtime 3 ms.
[2026-05-22 21:36:03] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-22 21:36:03] [INFO ] Invariant cache hit.
[2026-05-22 21:36:04] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2026-05-22 21:36:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 310/518 variables, 208/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 0/518 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 223 constraints, problems are : Problem set: 0 solved, 309 unsolved in 27480 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 310/518 variables, 208/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 309/532 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 536 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57588ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 57593ms
Starting structural reductions in LTL mode, iteration 1 : 208/230 places, 310/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58009 ms. Remains : 208/230 places, 310/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (X(G(p0))||(p1&&X((p0&&(p1 U X(p1)))))))))'
Stuttering acceptance computed with spot in 355 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-02 finished in 58427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 216 transition count 318
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 216 transition count 318
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 210 transition count 312
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 210 transition count 312
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 205 transition count 307
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 205 transition count 307
Applied a total of 50 rules in 18 ms. Remains 205 /230 variables (removed 25) and now considering 307/332 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8469184838747541481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13356244522673042864.kers'
[2026-05-22 21:37:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8469184838747541481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13356244522673042864.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 205 cols 808 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-22 21:37:02] [INFO ] Computed 15 invariants in 8 ms
Computed 15 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-13356244522673042864.kers
Total runtime 9 ms.
[2026-05-22 21:37:02] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-22 21:37:02] [INFO ] Invariant cache hit.
[2026-05-22 21:37:02] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2026-05-22 21:37:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/512 variables, 205/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 0/512 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 220 constraints, problems are : Problem set: 0 solved, 306 unsolved in 25661 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/512 variables, 205/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 306/526 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 530 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55776ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 55778ms
Starting structural reductions in LTL mode, iteration 1 : 205/230 places, 307/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56310 ms. Remains : 205/230 places, 307/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-05
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-05 finished in 56479 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((G(p0)||X(F((F(p1)&&(G(p2)||(p2&&F(p3)))))))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Graph (trivial) has 232 edges and 230 vertex of which 113 / 230 are part of one of the 14 SCC in 6 ms
Free SCC test removed 99 places
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Reduce places removed 1 places and 1 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 0 with 24 rules applied. Total rules applied 25 place count 130 transition count 196
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 46 rules applied. Total rules applied 71 place count 106 transition count 174
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 81 place count 96 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 81 place count 96 transition count 172
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 94 transition count 172
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 96 place count 83 transition count 142
Iterating global reduction 3 with 11 rules applied. Total rules applied 107 place count 83 transition count 142
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 115 place count 83 transition count 134
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 175 place count 53 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 177 place count 51 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 51 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 181 place count 51 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 185 place count 49 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 189 place count 49 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 191 place count 47 transition count 96
Applied a total of 191 rules in 149 ms. Remains 47 /230 variables (removed 183) and now considering 96/332 (removed 236) transitions.
[2026-05-22 21:37:58] [INFO ] Flow matrix only has 59 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18217669437279107841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9110425534560084506.kers'
[2026-05-22 21:37:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18217669437279107841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9110425534560084506.kers]
Normalized transition count is 58 out of 59 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 58 rows 44 cols 160 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-22 21:37:58] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9110425534560084506.kers
Total runtime 1 ms.
[2026-05-22 21:37:58] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-22 21:37:58] [INFO ] Flow matrix only has 59 transitions (discarded 37 similar events)
[2026-05-22 21:37:58] [INFO ] Invariant cache hit.
[2026-05-22 21:37:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 21:37:58] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2026-05-22 21:37:58] [INFO ] Redundant transitions in 5 ms returned []
Running 57 sub problems to find dead transitions.
[2026-05-22 21:37:58] [INFO ] Flow matrix only has 59 transitions (discarded 37 similar events)
[2026-05-22 21:37:58] [INFO ] Invariant cache hit.
[2026-05-22 21:37:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 58/105 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 63 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1919 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 58/105 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 57/120 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 120 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1752 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3685ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3685ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/230 places, 96/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4035 ms. Remains : 47/230 places, 96/332 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((G(p0)||X(F((F(p1)&&(G(p2)||(p2&&F(p3)))))))))'
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-06
Stuttering criterion allowed to conclude after 47 steps with 1 reset in 2 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-06 finished in 4461 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) U p1))||G(p2)))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 218 transition count 320
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 218 transition count 320
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 213 transition count 315
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 213 transition count 315
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 209 transition count 311
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 209 transition count 311
Applied a total of 42 rules in 27 ms. Remains 209 /230 variables (removed 21) and now considering 311/332 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12120642741064462042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16017442324464469440.kers'
[2026-05-22 21:38:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12120642741064462042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16017442324464469440.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 209 cols 816 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-22 21:38:03] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16017442324464469440.kers
Total runtime 3 ms.
[2026-05-22 21:38:03] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-22 21:38:03] [INFO ] Invariant cache hit.
[2026-05-22 21:38:03] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2026-05-22 21:38:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/520 variables, 209/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 0/520 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 224 constraints, problems are : Problem set: 0 solved, 310 unsolved in 26473 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/520 variables, 209/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 310/534 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 536 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56552ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 56555ms
Starting structural reductions in LTL mode, iteration 1 : 209/230 places, 311/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57097 ms. Remains : 209/230 places, 311/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0) U p1))||G(p2)))'
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-08 finished in 57488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(((G(!p1)||X(F(p2))) U (p0&&(G(!p1)||X(F(p2))))))) U (!p3&&(p0||X(((G(!p1)||X(F(p2))) U (p0&&(G(!p1)||X(F(p2)))))))))))'
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 216 transition count 318
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 216 transition count 318
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 210 transition count 312
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 210 transition count 312
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 205 transition count 307
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 205 transition count 307
Applied a total of 50 rules in 17 ms. Remains 205 /230 variables (removed 25) and now considering 307/332 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3185230033516059084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10204353253872723983.kers'
[2026-05-22 21:39:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3185230033516059084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10204353253872723983.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 205 cols 808 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-22 21:39:00] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10204353253872723983.kers
Total runtime 3 ms.
[2026-05-22 21:39:00] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-22 21:39:00] [INFO ] Invariant cache hit.
[2026-05-22 21:39:00] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2026-05-22 21:39:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/512 variables, 205/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 0/512 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 220 constraints, problems are : Problem set: 0 solved, 306 unsolved in 28304 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/512 variables, 205/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 306/526 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 530 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58343ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 58344ms
Starting structural reductions in LTL mode, iteration 1 : 205/230 places, 307/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58816 ms. Remains : 205/230 places, 307/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(((G(!p1)||X(F(p2))) U (p0&&(G(!p1)||X(F(p2))))))) U (!p3&&(p0||X(((G(!p1)||X(F(p2))) U (p0&&(G(!p1)||X(F(p2)))))))))))'
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-09
Stuttering criterion allowed to conclude after 344 steps with 2 reset in 5 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-09 finished in 59148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Graph (trivial) has 239 edges and 230 vertex of which 113 / 230 are part of one of the 14 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 130 transition count 194
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 50 rules applied. Total rules applied 77 place count 104 transition count 170
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 88 place count 93 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 88 place count 93 transition count 168
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 91 transition count 168
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 101 place count 82 transition count 143
Iterating global reduction 3 with 9 rules applied. Total rules applied 110 place count 82 transition count 143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 117 place count 82 transition count 136
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 183 place count 49 transition count 103
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 186 place count 46 transition count 92
Iterating global reduction 4 with 3 rules applied. Total rules applied 189 place count 46 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 192 place count 46 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 194 place count 44 transition count 87
Applied a total of 194 rules in 27 ms. Remains 44 /230 variables (removed 186) and now considering 87/332 (removed 245) transitions.
[2026-05-22 21:39:59] [INFO ] Flow matrix only has 44 transitions (discarded 43 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13884989635470780971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7000851134020547763.kers'
[2026-05-22 21:39:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13884989635470780971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7000851134020547763.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 43 rows 40 cols 106 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-22 21:39:59] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7000851134020547763.kers
Total runtime 0 ms.
[2026-05-22 21:39:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-22 21:39:59] [INFO ] Flow matrix only has 44 transitions (discarded 43 similar events)
[2026-05-22 21:39:59] [INFO ] Invariant cache hit.
[2026-05-22 21:39:59] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2026-05-22 21:39:59] [INFO ] Redundant transitions in 2 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-22 21:39:59] [INFO ] Flow matrix only has 44 transitions (discarded 43 similar events)
[2026-05-22 21:39:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 43/87 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/88 variables, and 59 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 43/87 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 46/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/88 variables, and 105 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2503ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2503ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/230 places, 87/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2679 ms. Remains : 44/230 places, 87/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-10 finished in 2752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X((p1&&X(F(p2))))))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 218 transition count 320
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 218 transition count 320
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 213 transition count 315
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 213 transition count 315
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 209 transition count 311
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 209 transition count 311
Applied a total of 42 rules in 8 ms. Remains 209 /230 variables (removed 21) and now considering 311/332 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6215752515246797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3006191594961268395.kers'
[2026-05-22 21:40:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6215752515246797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3006191594961268395.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 209 cols 816 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-22 21:40:02] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3006191594961268395.kers
Total runtime 2 ms.
[2026-05-22 21:40:02] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-22 21:40:02] [INFO ] Invariant cache hit.
[2026-05-22 21:40:02] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2026-05-22 21:40:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/520 variables, 209/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 0/520 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 224 constraints, problems are : Problem set: 0 solved, 310 unsolved in 25127 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/520 variables, 209/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 310/534 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 539 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55173ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 55174ms
Starting structural reductions in LTL mode, iteration 1 : 209/230 places, 311/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55566 ms. Remains : 209/230 places, 311/332 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X((p1&&X(F(p2))))))))'
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 21 ms. Proved property starting from automaton with 6 states, 7 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 32 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H05T1U-LTLFireability-11 finished in 56391 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 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Graph (trivial) has 239 edges and 230 vertex of which 119 / 230 are part of one of the 15 SCC in 1 ms
Free SCC test removed 104 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 125 transition count 191
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 49 rules applied. Total rules applied 75 place count 100 transition count 167
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 86 place count 89 transition count 167
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 96 place count 79 transition count 138
Iterating global reduction 3 with 10 rules applied. Total rules applied 106 place count 79 transition count 138
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 114 place count 79 transition count 130
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 178 place count 47 transition count 98
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 181 place count 44 transition count 87
Iterating global reduction 4 with 3 rules applied. Total rules applied 184 place count 44 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 187 place count 44 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 189 place count 42 transition count 82
Applied a total of 189 rules in 26 ms. Remains 42 /230 variables (removed 188) and now considering 82/332 (removed 250) transitions.
[2026-05-22 21:40:58] [INFO ] Flow matrix only has 41 transitions (discarded 41 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15268579423791161774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3176450782163756010.kers'
[2026-05-22 21:40:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15268579423791161774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3176450782163756010.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 40 rows 38 cols 100 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-22 21:40:58] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3176450782163756010.kers
Total runtime 1 ms.
[2026-05-22 21:40:58] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-22 21:40:58] [INFO ] Flow matrix only has 41 transitions (discarded 41 similar events)
[2026-05-22 21:40:58] [INFO ] Invariant cache hit.
[2026-05-22 21:40:58] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2026-05-22 21:40:58] [INFO ] Redundant transitions in 3 ms returned []
Running 40 sub problems to find dead transitions.
[2026-05-22 21:40:58] [INFO ] Flow matrix only has 41 transitions (discarded 41 similar events)
[2026-05-22 21:40:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/42 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 40/82 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/83 variables, and 57 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/42 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 40/82 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/83 variables, and 97 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2256ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2256ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/230 places, 82/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2429 ms. Remains : 42/230 places, 82/332 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 53 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-12 finished in 2514 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)&&F(G(p1)))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Graph (trivial) has 232 edges and 230 vertex of which 102 / 230 are part of one of the 13 SCC in 1 ms
Free SCC test removed 89 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 140 transition count 203
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 54 rules applied. Total rules applied 84 place count 111 transition count 178
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 96 place count 100 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 99 transition count 177
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 97 place count 99 transition count 174
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 103 place count 96 transition count 174
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 111 place count 88 transition count 151
Iterating global reduction 4 with 8 rules applied. Total rules applied 119 place count 88 transition count 151
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 125 place count 88 transition count 145
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 195 place count 53 transition count 110
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 198 place count 50 transition count 99
Iterating global reduction 5 with 3 rules applied. Total rules applied 201 place count 50 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 204 place count 50 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 206 place count 49 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 207 place count 49 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 209 place count 49 transition count 94
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 210 place count 48 transition count 92
Iterating global reduction 7 with 1 rules applied. Total rules applied 211 place count 48 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 212 place count 48 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 214 place count 46 transition count 89
Applied a total of 214 rules in 58 ms. Remains 46 /230 variables (removed 184) and now considering 89/332 (removed 243) transitions.
[2026-05-22 21:41:01] [INFO ] Flow matrix only has 47 transitions (discarded 42 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13288804907613085950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8041615659724530196.kers'
[2026-05-22 21:41:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13288804907613085950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8041615659724530196.kers]
Normalized transition count is 46 out of 47 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 46 rows 42 cols 112 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-22 21:41:01] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8041615659724530196.kers
Total runtime 0 ms.
[2026-05-22 21:41:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-22 21:41:01] [INFO ] Flow matrix only has 47 transitions (discarded 42 similar events)
[2026-05-22 21:41:01] [INFO ] Invariant cache hit.
[2026-05-22 21:41:01] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2026-05-22 21:41:01] [INFO ] Redundant transitions in 2 ms returned []
Running 50 sub problems to find dead transitions.
[2026-05-22 21:41:01] [INFO ] Flow matrix only has 47 transitions (discarded 42 similar events)
[2026-05-22 21:41:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 46/92 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/93 variables, and 61 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1498 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 46/92 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 50/111 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/93 variables, and 111 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2864ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2864ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/230 places, 89/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3133 ms. Remains : 46/230 places, 89/332 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-13 finished in 3277 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 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Graph (trivial) has 237 edges and 230 vertex of which 116 / 230 are part of one of the 15 SCC in 0 ms
Free SCC test removed 101 places
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 128 transition count 194
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 50 rules applied. Total rules applied 77 place count 102 transition count 170
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 88 place count 91 transition count 170
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 98 place count 81 transition count 141
Iterating global reduction 3 with 10 rules applied. Total rules applied 108 place count 81 transition count 141
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 116 place count 81 transition count 133
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 182 place count 48 transition count 100
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 185 place count 45 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 188 place count 45 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 191 place count 45 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 45 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 194 place count 43 transition count 83
Applied a total of 194 rules in 19 ms. Remains 43 /230 variables (removed 187) and now considering 83/332 (removed 249) transitions.
[2026-05-22 21:41:04] [INFO ] Flow matrix only has 46 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4017494241386246879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3251900543876678618.kers'
[2026-05-22 21:41:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4017494241386246879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3251900543876678618.kers]
Normalized transition count is 45 out of 46 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 45 rows 40 cols 120 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 21:41:04] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3251900543876678618.kers
Total runtime 1 ms.
[2026-05-22 21:41:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-22 21:41:04] [INFO ] Flow matrix only has 46 transitions (discarded 37 similar events)
[2026-05-22 21:41:04] [INFO ] Invariant cache hit.
[2026-05-22 21:41:04] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2026-05-22 21:41:04] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2026-05-22 21:41:04] [INFO ] Flow matrix only has 46 transitions (discarded 37 similar events)
[2026-05-22 21:41:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/89 variables, and 58 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1063 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 43/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/89 variables, and 101 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2230ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 2231ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/230 places, 83/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2404 ms. Remains : 43/230 places, 83/332 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 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-14 finished in 2508 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(F(!p1)))))) U (F(p3)&&p2)))'
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 332/332 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 217 transition count 319
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 217 transition count 319
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 211 transition count 313
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 211 transition count 313
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 206 transition count 308
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 206 transition count 308
Applied a total of 48 rules in 13 ms. Remains 206 /230 variables (removed 24) and now considering 308/332 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5812125703994652434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-220557137047063991.kers'
[2026-05-22 21:41:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5812125703994652434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-220557137047063991.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 206 cols 810 entries
Finished phase 1 with 191 SingleSign rule and 0 generalized
[2026-05-22 21:41:07] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-220557137047063991.kers
Total runtime 2 ms.
[2026-05-22 21:41:07] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-22 21:41:07] [INFO ] Invariant cache hit.
[2026-05-22 21:41:07] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-22 21:41:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/514 variables, 206/223 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 0/514 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 223 constraints, problems are : Problem set: 0 solved, 307 unsolved in 29933 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/514 variables, 206/223 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 307/530 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 5/535 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 538 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59995ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 59996ms
Starting structural reductions in LTL mode, iteration 1 : 206/230 places, 308/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60395 ms. Remains : 206/230 places, 308/332 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(F(!p1)))))) U (F(p3)&&p2)))'
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) p1), (NOT p3), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : Champagne-PT-H05T1U-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLFireability-15 finished in 60807 ms.
All properties solved by simple procedures.
Total runtime 489482 ms.
BK_STOP 1779486127896
--------------------
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-H05T1U"
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-H05T1U, 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-177946901000036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H05T1U.tgz
mv Champagne-PT-H05T1U execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;