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.r066-tall-177946967700412.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 CO4-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.3K Mar 6 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 6 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 248K 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 CO4-PT-17-LTLFireability-00
FORMULA_NAME CO4-PT-17-LTLFireability-01
FORMULA_NAME CO4-PT-17-LTLFireability-02
FORMULA_NAME CO4-PT-17-LTLFireability-03
FORMULA_NAME CO4-PT-17-LTLFireability-04
FORMULA_NAME CO4-PT-17-LTLFireability-05
FORMULA_NAME CO4-PT-17-LTLFireability-06
FORMULA_NAME CO4-PT-17-LTLFireability-07
FORMULA_NAME CO4-PT-17-LTLFireability-08
FORMULA_NAME CO4-PT-17-LTLFireability-09
FORMULA_NAME CO4-PT-17-LTLFireability-10
FORMULA_NAME CO4-PT-17-LTLFireability-11
FORMULA_NAME CO4-PT-17-LTLFireability-12
FORMULA_NAME CO4-PT-17-LTLFireability-13
FORMULA_NAME CO4-PT-17-LTLFireability-14
FORMULA_NAME CO4-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779524909196

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 08:28:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:28:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:28:30] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-23 08:28:30] [INFO ] Transformed 967 places.
[2026-05-23 08:28:30] [INFO ] Transformed 1150 transitions.
[2026-05-23 08:28:30] [INFO ] Found NUPN structural information;
[2026-05-23 08:28:30] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 198 places in 12 ms
Reduce places removed 198 places and 238 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-17-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 750 transition count 911
Discarding 161 places :
Symmetric choice reduction at 1 with 161 rule applications. Total rules 181 place count 589 transition count 750
Iterating global reduction 1 with 161 rules applied. Total rules applied 342 place count 589 transition count 750
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 350 place count 589 transition count 742
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 430 place count 509 transition count 662
Iterating global reduction 2 with 80 rules applied. Total rules applied 510 place count 509 transition count 662
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 526 place count 493 transition count 643
Iterating global reduction 2 with 16 rules applied. Total rules applied 542 place count 493 transition count 643
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 544 place count 493 transition count 641
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 547 place count 490 transition count 638
Iterating global reduction 3 with 3 rules applied. Total rules applied 550 place count 490 transition count 638
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 552 place count 488 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 554 place count 488 transition count 636
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 556 place count 488 transition count 634
Applied a total of 556 rules in 196 ms. Remains 488 /769 variables (removed 281) and now considering 634/912 (removed 278) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14006107111269324183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-809621361897422858.kers'
[2026-05-23 08:28:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14006107111269324183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-809621361897422858.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 634 rows 488 cols 1452 entries
Finished phase 1 with 483 SingleSign rule and 0 generalized
[2026-05-23 08:28:31] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-809621361897422858.kers
Total runtime 3 ms.
[2026-05-23 08:28:31] [INFO ] Implicit Places using invariants in 332 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 364 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 487/769 places, 634/912 transitions.
Applied a total of 0 rules in 14 ms. Remains 487 /487 variables (removed 0) and now considering 634/634 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 587 ms. Remains : 487/769 places, 634/912 transitions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 634/634 transitions.
Applied a total of 0 rules in 13 ms. Remains 487 /487 variables (removed 0) and now considering 634/634 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2571797954468093952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-686882576268219509.kers'
[2026-05-23 08:28:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2571797954468093952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-686882576268219509.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 634 rows 487 cols 1450 entries
Finished phase 1 with 483 SingleSign rule and 0 generalized
[2026-05-23 08:28:31] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-686882576268219509.kers
Total runtime 2 ms.
[2026-05-23 08:28:31] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-23 08:28:31] [INFO ] Invariant cache hit.
[2026-05-23 08:28:31] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 633 sub problems to find dead transitions.
[2026-05-23 08:28:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 3 (OVERLAPS) 634/1121 variables, 487/491 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1121/1121 variables, and 491 constraints, problems are : Problem set: 0 solved, 633 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 633/633 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 633 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 3 (OVERLAPS) 634/1121 variables, 487/491 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1121 variables, 633/1124 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1121/1121 variables, and 1124 constraints, problems are : Problem set: 0 solved, 633 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 633/633 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 633 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in LTL mode , in 1 iterations and 60681 ms. Remains : 487/487 places, 634/634 transitions.
Support contains 18 out of 487 places after structural reductions.
[2026-05-23 08:29:32] [INFO ] Flatten gal took : 60 ms
[2026-05-23 08:29:32] [INFO ] Flatten gal took : 27 ms
[2026-05-23 08:29:32] [INFO ] Input system was already deterministic with 634 transitions.
RANDOM walk for 40000 steps (74 resets) in 1298 ms. (30 steps per ms) remains 13/17 properties
BEST_FIRST walk for 40000 steps (31 resets) in 315 ms. (126 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40000 steps (43 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (21 resets) in 226 ms. (176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (108 resets) in 140 ms. (283 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40000 steps (80 resets) in 309 ms. (129 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40000 steps (58 resets) in 255 ms. (156 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (89 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (81 resets) in 131 ms. (303 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40000 steps (19 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (88 resets) in 92 ms. (430 steps per ms) remains 7/8 properties
[2026-05-23 08:29:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 65/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 334/407 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 12/419 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 10/429 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 441/870 variables, 220/341 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/870 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 220/1090 variables, 127/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1090 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 29/1119 variables, 22/490 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1119 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/1121 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1121 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/1121 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1121/1121 variables, and 491 constraints, problems are : Problem set: 0 solved, 7 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 65/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 334/407 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 12/419 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 10/429 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 441/870 variables, 220/348 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/870 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 220/1090 variables, 127/475 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1090 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 29/1119 variables, 22/497 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1119 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/1121 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1121 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/1121 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1121/1121 variables, and 498 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2278 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3090ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 6 properties in 504 ms.
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 634/634 transitions.
Graph (trivial) has 529 edges and 487 vertex of which 2 / 487 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 822 edges and 486 vertex of which 465 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 194 rules applied. Total rules applied 196 place count 465 transition count 420
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 177 rules applied. Total rules applied 373 place count 289 transition count 419
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 373 place count 289 transition count 356
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 499 place count 226 transition count 356
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 503 place count 222 transition count 352
Iterating global reduction 2 with 4 rules applied. Total rules applied 507 place count 222 transition count 352
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 509 place count 220 transition count 350
Iterating global reduction 2 with 2 rules applied. Total rules applied 511 place count 220 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 513 place count 220 transition count 348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 514 place count 219 transition count 348
Performed 76 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 666 place count 143 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 671 place count 143 transition count 252
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 678 place count 136 transition count 245
Iterating global reduction 5 with 7 rules applied. Total rules applied 685 place count 136 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 686 place count 136 transition count 244
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 694 place count 132 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 696 place count 132 transition count 238
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 7 with 86 rules applied. Total rules applied 782 place count 89 transition count 241
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 810 place count 89 transition count 213
Discarding 39 places :
Symmetric choice reduction at 8 with 39 rule applications. Total rules 849 place count 50 transition count 135
Iterating global reduction 8 with 39 rules applied. Total rules applied 888 place count 50 transition count 135
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 915 place count 50 transition count 108
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 925 place count 40 transition count 79
Iterating global reduction 9 with 10 rules applied. Total rules applied 935 place count 40 transition count 79
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 942 place count 40 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 944 place count 39 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 947 place count 39 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 955 place count 39 transition count 69
Free-agglomeration rule applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 960 place count 39 transition count 64
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 968 place count 34 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 970 place count 34 transition count 61
Graph (complete) has 118 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 971 place count 33 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 972 place count 33 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 973 place count 33 transition count 60
Graph (complete) has 115 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 974 place count 32 transition count 60
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 975 place count 32 transition count 59
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 976 place count 32 transition count 59
Graph (complete) has 112 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 977 place count 31 transition count 59
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 978 place count 31 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 979 place count 30 transition count 57
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t42.t548 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 26 vertex of which 3 / 26 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 18 with 3 rules applied. Total rules applied 982 place count 24 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 987 place count 24 transition count 50
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 988 place count 23 transition count 48
Iterating global reduction 20 with 1 rules applied. Total rules applied 989 place count 23 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 990 place count 23 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 21 with 10 rules applied. Total rules applied 1000 place count 23 transition count 37
Discarding 6 places :
Symmetric choice reduction at 21 with 6 rule applications. Total rules 1006 place count 17 transition count 31
Iterating global reduction 21 with 6 rules applied. Total rules applied 1012 place count 17 transition count 31
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 1018 place count 17 transition count 25
Discarding 3 places :
Symmetric choice reduction at 22 with 3 rule applications. Total rules 1021 place count 14 transition count 22
Iterating global reduction 22 with 3 rules applied. Total rules applied 1024 place count 14 transition count 22
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1027 place count 14 transition count 19
Free-agglomeration rule applied 3 times.
Iterating global reduction 23 with 3 rules applied. Total rules applied 1030 place count 14 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 1033 place count 11 transition count 16
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 24 with 3 rules applied. Total rules applied 1036 place count 11 transition count 16
Applied a total of 1036 rules in 126 ms. Remains 11 /487 variables (removed 476) and now considering 16/634 (removed 618) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 11/487 places, 16/634 transitions.
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
FORMULA CO4-PT-17-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 824 edges and 487 vertex of which 484 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 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(F((p0&&G(p1))))) U !p1)))'
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 634/634 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 480 transition count 627
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 480 transition count 627
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 475 transition count 622
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 475 transition count 622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 474 transition count 621
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 474 transition count 621
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 474 transition count 620
Applied a total of 27 rules in 35 ms. Remains 474 /487 variables (removed 13) and now considering 620/634 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3439291435964675910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5907844353278131842.kers'
[2026-05-23 08:29:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3439291435964675910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5907844353278131842.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 620 rows 474 cols 1418 entries
Finished phase 1 with 470 SingleSign rule and 0 generalized
[2026-05-23 08:29:37] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5907844353278131842.kers
Total runtime 5 ms.
[2026-05-23 08:29:37] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-23 08:29:37] [INFO ] Invariant cache hit.
[2026-05-23 08:29:37] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2026-05-23 08:29:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1094 variables, 474/478 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1094 variables, and 480 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (OVERLAPS) 620/1094 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1094 variables, 619/1099 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1094 variables, and 1099 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 474/487 places, 620/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60531 ms. Remains : 474/487 places, 620/634 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(F((p0&&G(p1))))) U !p1)))'
Stuttering acceptance computed with spot in 481 ms :[p1, p1, true, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-17-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CO4-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-01 finished in 61107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(F((p0&&F(p1))))) U X(X((p0 U p2)))))'
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 634/634 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 479 transition count 626
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 479 transition count 626
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 474 transition count 621
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 474 transition count 621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 473 transition count 620
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 473 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 473 transition count 619
Applied a total of 29 rules in 31 ms. Remains 473 /487 variables (removed 14) and now considering 619/634 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3382663501311107588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5714921017808138699.kers'
[2026-05-23 08:30:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3382663501311107588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5714921017808138699.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 619 rows 473 cols 1414 entries
Finished phase 1 with 469 SingleSign rule and 0 generalized
[2026-05-23 08:30:38] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5714921017808138699.kers
Total runtime 3 ms.
[2026-05-23 08:30:38] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-23 08:30:38] [INFO ] Invariant cache hit.
[2026-05-23 08:30:38] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2026-05-23 08:30:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 618/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1097 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 473/487 places, 619/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60560 ms. Remains : 473/487 places, 619/634 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(F((p0&&F(p1))))) U X(X((p0 U p2)))))'
Stuttering acceptance computed with spot in 427 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-17-LTLFireability-04
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 2 ms.
FORMULA CO4-PT-17-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-04 finished in 61041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 634/634 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 479 transition count 626
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 479 transition count 626
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 473 transition count 620
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 473 transition count 620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 472 transition count 619
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 472 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 472 transition count 618
Applied a total of 31 rules in 35 ms. Remains 472 /487 variables (removed 15) and now considering 618/634 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2970710909944164378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16812905236329664083.kers'
[2026-05-23 08:31:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2970710909944164378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16812905236329664083.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 618 rows 472 cols 1412 entries
Finished phase 1 with 468 SingleSign rule and 0 generalized
[2026-05-23 08:31:39] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16812905236329664083.kers
Total runtime 5 ms.
[2026-05-23 08:31:39] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-23 08:31:39] [INFO ] Invariant cache hit.
[2026-05-23 08:31:39] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2026-05-23 08:31:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 472/487 places, 618/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60497 ms. Remains : 472/487 places, 618/634 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Stuttering acceptance computed with spot in 204 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-05 finished in 60740 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||G(p1))))'
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 634/634 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 479 transition count 626
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 479 transition count 626
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 474 transition count 621
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 474 transition count 621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 473 transition count 620
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 473 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 473 transition count 619
Applied a total of 29 rules in 30 ms. Remains 473 /487 variables (removed 14) and now considering 619/634 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7541441724758471809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3211212890384769716.kers'
[2026-05-23 08:32:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7541441724758471809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3211212890384769716.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 619 rows 473 cols 1414 entries
Finished phase 1 with 469 SingleSign rule and 0 generalized
[2026-05-23 08:32:40] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3211212890384769716.kers
Total runtime 5 ms.
[2026-05-23 08:32:40] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-23 08:32:40] [INFO ] Invariant cache hit.
[2026-05-23 08:32:40] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2026-05-23 08:32:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 618/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1097 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 473/487 places, 619/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60525 ms. Remains : 473/487 places, 619/634 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||G(p1))))'
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 804 edges and 473 vertex of which 470 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 21 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 34 ms.
FORMULA CO4-PT-17-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-17-LTLFireability-07 finished in 61179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 634/634 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 478 transition count 625
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 478 transition count 625
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 472 transition count 619
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 472 transition count 619
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 471 transition count 618
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 471 transition count 617
Applied a total of 33 rules in 28 ms. Remains 471 /487 variables (removed 16) and now considering 617/634 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17457371498516938313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14976225695779460217.kers'
[2026-05-23 08:33:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17457371498516938313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14976225695779460217.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 617 rows 471 cols 1410 entries
Finished phase 1 with 467 SingleSign rule and 0 generalized
[2026-05-23 08:33:41] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14976225695779460217.kers
Total runtime 2 ms.
[2026-05-23 08:33:41] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-23 08:33:41] [INFO ] Invariant cache hit.
[2026-05-23 08:33:41] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2026-05-23 08:33:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 471/487 places, 617/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60485 ms. Remains : 471/487 places, 617/634 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : CO4-PT-17-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-09 finished in 60663 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||G(p1)))))'
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 634/634 transitions.
Graph (trivial) has 527 edges and 487 vertex of which 2 / 487 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 823 edges and 486 vertex of which 483 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 482 transition count 457
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 173 rules applied. Total rules applied 347 place count 311 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 348 place count 310 transition count 455
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 348 place count 310 transition count 392
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 474 place count 247 transition count 392
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 477 place count 244 transition count 389
Iterating global reduction 3 with 3 rules applied. Total rules applied 480 place count 244 transition count 389
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 482 place count 242 transition count 387
Iterating global reduction 3 with 2 rules applied. Total rules applied 484 place count 242 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 486 place count 242 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 487 place count 241 transition count 385
Performed 84 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 5 with 168 rules applied. Total rules applied 655 place count 157 transition count 282
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 663 place count 157 transition count 274
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 665 place count 156 transition count 273
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 672 place count 149 transition count 266
Iterating global reduction 7 with 7 rules applied. Total rules applied 679 place count 149 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 680 place count 149 transition count 265
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 688 place count 145 transition count 261
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 8 with 88 rules applied. Total rules applied 776 place count 101 transition count 264
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 805 place count 101 transition count 235
Discarding 39 places :
Symmetric choice reduction at 9 with 39 rule applications. Total rules 844 place count 62 transition count 157
Iterating global reduction 9 with 39 rules applied. Total rules applied 883 place count 62 transition count 157
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 910 place count 62 transition count 130
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 920 place count 52 transition count 101
Iterating global reduction 10 with 10 rules applied. Total rules applied 930 place count 52 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 937 place count 52 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 940 place count 52 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 942 place count 50 transition count 89
Applied a total of 942 rules in 70 ms. Remains 50 /487 variables (removed 437) and now considering 89/634 (removed 545) transitions.
[2026-05-23 08:34:42] [INFO ] Flow matrix only has 81 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12529200829290160817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7399261417158906383.kers'
[2026-05-23 08:34:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12529200829290160817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7399261417158906383.kers]
Normalized transition count is 80 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 50 cols 241 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-23 08:34:42] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7399261417158906383.kers
Total runtime 0 ms.
[2026-05-23 08:34:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-23 08:34:42] [INFO ] Flow matrix only has 81 transitions (discarded 8 similar events)
[2026-05-23 08:34:42] [INFO ] Invariant cache hit.
[2026-05-23 08:34:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:34:42] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2026-05-23 08:34:42] [INFO ] Redundant transitions in 3 ms returned []
Running 76 sub problems to find dead transitions.
[2026-05-23 08:34:42] [INFO ] Flow matrix only has 81 transitions (discarded 8 similar events)
[2026-05-23 08:34:42] [INFO ] Invariant cache hit.
[2026-05-23 08:34:42] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 80/130 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 1/131 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 56 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1666 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 80/130 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 76/131 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 132 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2330 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4010ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 4010ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/487 places, 89/634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4182 ms. Remains : 50/487 places, 89/634 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLFireability-10
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA CO4-PT-17-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-10 finished in 4290 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 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 634/634 transitions.
Graph (trivial) has 531 edges and 487 vertex of which 2 / 487 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 823 edges and 486 vertex of which 483 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 175 rules applied. Total rules applied 177 place count 482 transition count 454
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 175 rules applied. Total rules applied 352 place count 308 transition count 453
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 352 place count 308 transition count 389
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 480 place count 244 transition count 389
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 483 place count 241 transition count 386
Iterating global reduction 2 with 3 rules applied. Total rules applied 486 place count 241 transition count 386
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 488 place count 239 transition count 384
Iterating global reduction 2 with 2 rules applied. Total rules applied 490 place count 239 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 492 place count 239 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 238 transition count 382
Performed 83 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 659 place count 155 transition count 279
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 667 place count 155 transition count 271
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 669 place count 154 transition count 270
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 676 place count 147 transition count 263
Iterating global reduction 6 with 7 rules applied. Total rules applied 683 place count 147 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 684 place count 147 transition count 262
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 692 place count 143 transition count 258
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 782 place count 98 transition count 261
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 812 place count 98 transition count 231
Discarding 39 places :
Symmetric choice reduction at 8 with 39 rule applications. Total rules 851 place count 59 transition count 153
Iterating global reduction 8 with 39 rules applied. Total rules applied 890 place count 59 transition count 153
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 917 place count 59 transition count 126
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 926 place count 50 transition count 100
Iterating global reduction 9 with 9 rules applied. Total rules applied 935 place count 50 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 941 place count 50 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 944 place count 50 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 946 place count 48 transition count 89
Applied a total of 946 rules in 67 ms. Remains 48 /487 variables (removed 439) and now considering 89/634 (removed 545) transitions.
[2026-05-23 08:34:46] [INFO ] Flow matrix only has 80 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4936148254357320382.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1199666994961324794.kers'
[2026-05-23 08:34:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4936148254357320382.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1199666994961324794.kers]
Normalized transition count is 79 out of 80 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 79 rows 48 cols 240 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-23 08:34:46] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1199666994961324794.kers
Total runtime 1 ms.
[2026-05-23 08:34:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 08:34:46] [INFO ] Flow matrix only has 80 transitions (discarded 9 similar events)
[2026-05-23 08:34:46] [INFO ] Invariant cache hit.
[2026-05-23 08:34:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:34:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2026-05-23 08:34:46] [INFO ] Redundant transitions in 2 ms returned []
Running 76 sub problems to find dead transitions.
[2026-05-23 08:34:46] [INFO ] Flow matrix only has 80 transitions (discarded 9 similar events)
[2026-05-23 08:34:46] [INFO ] Invariant cache hit.
[2026-05-23 08:34:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 79/127 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 1/128 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 54 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1633 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 79/127 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 76/129 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 130 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2399 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4055ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 4055ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/487 places, 89/634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4230 ms. Remains : 48/487 places, 89/634 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-12
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA CO4-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-12 finished in 4319 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||G(F(p0)))))'
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 634/634 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 479 transition count 626
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 479 transition count 626
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 474 transition count 621
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 474 transition count 621
Applied a total of 26 rules in 27 ms. Remains 474 /487 variables (removed 13) and now considering 621/634 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14741953861593630242.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1744471496244150323.kers'
[2026-05-23 08:34:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14741953861593630242.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1744471496244150323.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 621 rows 474 cols 1420 entries
Finished phase 1 with 470 SingleSign rule and 0 generalized
[2026-05-23 08:34:50] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1744471496244150323.kers
Total runtime 3 ms.
[2026-05-23 08:34:50] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-23 08:34:50] [INFO ] Invariant cache hit.
[2026-05-23 08:34:51] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2026-05-23 08:34:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 621/1095 variables, 474/478 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 480 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (OVERLAPS) 621/1095 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1095 variables, 620/1100 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1100 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 474/487 places, 621/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60514 ms. Remains : 474/487 places, 621/634 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||G(F(p0)))))'
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-14
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-14 finished in 60745 ms.
All properties solved by simple procedures.
Total runtime 441135 ms.

BK_STOP 1779525351544

--------------------
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="CO4-PT-17"
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 CO4-PT-17, 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 r066-tall-177946967700412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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