About the Execution of ITS-Tools for CO4-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 996.084 | 602644.00 | 721433.00 | 1404.40 | TFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700404.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-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700404
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:28 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 260K 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-16-LTLFireability-00
FORMULA_NAME CO4-PT-16-LTLFireability-01
FORMULA_NAME CO4-PT-16-LTLFireability-02
FORMULA_NAME CO4-PT-16-LTLFireability-03
FORMULA_NAME CO4-PT-16-LTLFireability-04
FORMULA_NAME CO4-PT-16-LTLFireability-05
FORMULA_NAME CO4-PT-16-LTLFireability-06
FORMULA_NAME CO4-PT-16-LTLFireability-07
FORMULA_NAME CO4-PT-16-LTLFireability-08
FORMULA_NAME CO4-PT-16-LTLFireability-09
FORMULA_NAME CO4-PT-16-LTLFireability-10
FORMULA_NAME CO4-PT-16-LTLFireability-11
FORMULA_NAME CO4-PT-16-LTLFireability-12
FORMULA_NAME CO4-PT-16-LTLFireability-13
FORMULA_NAME CO4-PT-16-LTLFireability-14
FORMULA_NAME CO4-PT-16-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779524134939
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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 08:15:36] [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:15:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:15:36] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-23 08:15:36] [INFO ] Transformed 837 places.
[2026-05-23 08:15:36] [INFO ] Transformed 1122 transitions.
[2026-05-23 08:15:36] [INFO ] Found NUPN structural information;
[2026-05-23 08:15:36] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 200 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 4 formulas.
Deduced a syphon composed of 116 places in 10 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 721/721 places, 942/942 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 704 transition count 939
Discarding 161 places :
Symmetric choice reduction at 1 with 161 rule applications. Total rules 181 place count 543 transition count 776
Iterating global reduction 1 with 161 rules applied. Total rules applied 342 place count 543 transition count 776
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 348 place count 543 transition count 770
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 434 place count 457 transition count 667
Iterating global reduction 2 with 86 rules applied. Total rules applied 520 place count 457 transition count 667
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 523 place count 457 transition count 664
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 540 place count 440 transition count 639
Iterating global reduction 3 with 17 rules applied. Total rules applied 557 place count 440 transition count 639
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 560 place count 440 transition count 636
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 568 place count 432 transition count 628
Iterating global reduction 4 with 8 rules applied. Total rules applied 576 place count 432 transition count 628
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 581 place count 427 transition count 623
Iterating global reduction 4 with 5 rules applied. Total rules applied 586 place count 427 transition count 623
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 591 place count 427 transition count 618
Applied a total of 591 rules in 169 ms. Remains 427 /721 variables (removed 294) and now considering 618/942 (removed 324) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9666312508241496784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1113140790548797877.kers'
[2026-05-23 08:15:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9666312508241496784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1113140790548797877.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 618 rows 427 cols 1676 entries
Finished phase 1 with 420 SingleSign rule and 0 generalized
[2026-05-23 08:15:36] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1113140790548797877.kers
Total runtime 3 ms.
[2026-05-23 08:15:36] [INFO ] Implicit Places using invariants in 299 ms returned [5, 361]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 331 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 425/721 places, 618/942 transitions.
Applied a total of 0 rules in 11 ms. Remains 425 /425 variables (removed 0) and now considering 618/618 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 525 ms. Remains : 425/721 places, 618/942 transitions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Applied a total of 0 rules in 17 ms. Remains 425 /425 variables (removed 0) and now considering 618/618 (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-16042877799876258833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14991982945699765576.kers'
[2026-05-23 08:15:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16042877799876258833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14991982945699765576.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 618 rows 425 cols 1657 entries
Finished phase 1 with 420 SingleSign rule and 0 generalized
[2026-05-23 08:15:37] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14991982945699765576.kers
Total runtime 2 ms.
[2026-05-23 08:15:37] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-23 08:15:37] [INFO ] Invariant cache hit.
[2026-05-23 08:15:37] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2026-05-23 08:15:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/425 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1043 variables, 425/433 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1043/1043 variables, and 435 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 5/5 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/424 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/425 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1043 variables, 425/435 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1043 variables, 617/1052 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1043/1043 variables, and 1052 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60298ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Finished structural reductions in LTL mode , in 1 iterations and 60757 ms. Remains : 425/425 places, 618/618 transitions.
Support contains 27 out of 425 places after structural reductions.
[2026-05-23 08:16:37] [INFO ] Flatten gal took : 62 ms
[2026-05-23 08:16:38] [INFO ] Flatten gal took : 31 ms
[2026-05-23 08:16:38] [INFO ] Input system was already deterministic with 618 transitions.
Support contains 26 out of 425 places (down from 27) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (901 resets) in 1541 ms. (25 steps per ms) remains 12/22 properties
BEST_FIRST walk for 40004 steps (114 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (158 resets) in 204 ms. (195 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (154 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (124 resets) in 145 ms. (273 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (150 resets) in 108 ms. (366 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (154 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (153 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (157 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (164 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (113 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (148 resets) in 124 ms. (320 steps per ms) remains 10/12 properties
[2026-05-23 08:16:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 19/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 14/48 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 176/224 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 422/646 variables, 148/201 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 331/977 variables, 182/383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 56/1033 variables, 41/424 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1033 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 10/1043 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1043 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/1043 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1043/1043 variables, and 430 constraints, problems are : Problem set: 0 solved, 10 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 19/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 14/48 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 176/224 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 422/646 variables, 148/203 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 8/211 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 331/977 variables, 182/393 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 56/1033 variables, 41/434 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1033 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 10/1043 variables, 6/440 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1043 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/1043 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1043/1043 variables, and 440 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2614 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3577ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 1502 steps, including 21 resets, run visited all 1 properties in 3 ms. (steps per millisecond=500 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 1130 ms.
Computed a total of 20 stabilizing places and 35 stable transitions
Graph (complete) has 924 edges and 425 vertex of which 421 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G((p1 U X((X(F(p3))&&p2)))))))'
Support contains 6 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 416 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 416 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 416 transition count 605
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 411 transition count 599
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 411 transition count 599
Applied a total of 29 rules in 25 ms. Remains 411 /425 variables (removed 14) and now considering 599/618 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4990929271814983197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16812123310933357604.kers'
[2026-05-23 08:16:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4990929271814983197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16812123310933357604.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 599 rows 411 cols 1600 entries
Finished phase 1 with 406 SingleSign rule and 0 generalized
[2026-05-23 08:16:44] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16812123310933357604.kers
Total runtime 7 ms.
[2026-05-23 08:16:44] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-23 08:16:44] [INFO ] Invariant cache hit.
[2026-05-23 08:16:44] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2026-05-23 08:16:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (OVERLAPS) 599/1010 variables, 411/416 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 418 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (OVERLAPS) 599/1010 variables, 411/419 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 598/1017 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1017 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in LTL mode, iteration 1 : 411/425 places, 599/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60538 ms. Remains : 411/425 places, 599/618 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G((p1 U X((X(F(p3))&&p2)))))))'
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-04
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 3 ms.
FORMULA CO4-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-04 finished in 61092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F((G(F(p1))||(F(p1)&&X(p2))))&&(X(p1) U ((X(p1)&&G(p3))||X(G(p1)))))))'
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 417 transition count 607
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 417 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 417 transition count 605
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 413 transition count 601
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 413 transition count 601
Applied a total of 26 rules in 22 ms. Remains 413 /425 variables (removed 12) and now considering 601/618 (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-9535271212923820396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1654413885912973656.kers'
[2026-05-23 08:17:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9535271212923820396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1654413885912973656.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 601 rows 413 cols 1613 entries
Finished phase 1 with 408 SingleSign rule and 0 generalized
[2026-05-23 08:17:45] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1654413885912973656.kers
Total runtime 2 ms.
[2026-05-23 08:17:45] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-23 08:17:45] [INFO ] Invariant cache hit.
[2026-05-23 08:17:45] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2026-05-23 08:17:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/419 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 421 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/421 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 600/1021 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 1021 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 413/425 places, 601/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60536 ms. Remains : 413/425 places, 601/618 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F((G(F(p1))||(F(p1)&&X(p2))))&&(X(p1) U ((X(p1)&&G(p3))||X(G(p1)))))))'
Stuttering acceptance computed with spot in 566 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p0)), true, (AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : CO4-PT-16-LTLFireability-05
Product exploration explored 100000 steps with 37338 reset in 263 ms.
Product exploration explored 100000 steps with 37603 reset in 209 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 902 edges and 413 vertex of which 410 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge based reduction with 43 factoid took 169 ms. Reduced automaton from 17 states, 61 edges and 4 AP (stutter sensitive) to 7 states, 18 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (891 resets) in 356 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (156 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (155 resets) in 68 ms. (579 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (157 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (132 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
[2026-05-23 08:18:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 118/126 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/135 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 23/158 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 266/424 variables, 123/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 241/665 variables, 103/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/665 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 227/892 variables, 97/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/892 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
At refinement iteration 16 (OVERLAPS) 97/989 variables, 61/404 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/989 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 17/1006 variables, 10/414 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1006 variables, 0/414 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/1014 variables, 4/418 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1014 variables, 0/418 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1014 variables, 0/418 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 418 constraints, problems are : Problem set: 1 solved, 2 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 118/126 variables, 11/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/135 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 23/158 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 266/424 variables, 123/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 241/665 variables, 103/248 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 227/892 variables, 97/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/892 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 97/989 variables, 61/406 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/989 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 17/1006 variables, 10/416 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1006 variables, 0/416 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 8/1014 variables, 4/420 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 420 constraints, problems are : Problem set: 1 solved, 2 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1339ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 44 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=22 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 44 factoid took 168 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Knowledge-based reduction took 2164 ms.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Support contains 2 out of 413 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 601/601 transitions.
Applied a total of 0 rules in 11 ms. Remains 413 /413 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2026-05-23 08:18:49] [INFO ] Invariant cache hit.
[2026-05-23 08:18:49] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 08:18:49] [INFO ] Invariant cache hit.
[2026-05-23 08:18:49] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 413/413 places, 601/601 transitions.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 902 edges and 413 vertex of which 410 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge based reduction with 7 factoid took 57 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (749 resets) in 147 ms. (270 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (162 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2026-05-23 08:18:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/115 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/124 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/147 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 262/409 variables, 120/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 247/656 variables, 105/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/656 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 236/892 variables, 102/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/892 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 97/989 variables, 61/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/989 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 17/1006 variables, 10/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1006 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1014 variables, 4/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1014 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1014 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/115 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/124 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/147 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 262/409 variables, 120/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 247/656 variables, 105/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/656 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 236/892 variables, 102/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/892 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 97/989 variables, 61/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/989 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 17/1006 variables, 10/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1006 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/1014 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 737ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3211 steps, including 90 resets, run visited all 1 properties in 6 ms. (steps per millisecond=535 )
Parikh walk visited 1 properties in 5 ms.
Knowledge based reduction with 7 factoid took 80 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Knowledge-based reduction took 1183 ms.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 25108 reset in 125 ms.
Product exploration explored 100000 steps with 25019 reset in 136 ms.
Spot run failed in 72 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin16475458631216158264
[2026-05-23 08:18:51] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16475458631216158264
Running compilation step : cd /tmp/ltsmin16475458631216158264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1001 ms.
Running link step : cd /tmp/ltsmin16475458631216158264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16475458631216158264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10698682421698688320.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 601/601 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 412 transition count 600
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 412 transition count 600
Applied a total of 2 rules in 10 ms. Remains 412 /413 variables (removed 1) and now considering 600/601 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13317113464242505681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13896401390616431156.kers'
[2026-05-23 08:19:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13317113464242505681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13896401390616431156.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 600 rows 412 cols 1611 entries
Finished phase 1 with 407 SingleSign rule and 0 generalized
[2026-05-23 08:19:06] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13896401390616431156.kers
Total runtime 2 ms.
[2026-05-23 08:19:06] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 08:19:06] [INFO ] Invariant cache hit.
[2026-05-23 08:19:07] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2026-05-23 08:19:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/1012 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 419 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (OVERLAPS) 600/1012 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 599/1019 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1019 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 412/413 places, 600/601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60483 ms. Remains : 412/413 places, 600/601 transitions.
Built C files in :
/tmp/ltsmin12006038822382864311
[2026-05-23 08:20:07] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12006038822382864311
Running compilation step : cd /tmp/ltsmin12006038822382864311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 837 ms.
Running link step : cd /tmp/ltsmin12006038822382864311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12006038822382864311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased1511730705232938772.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 08:20:22] [INFO ] Flatten gal took : 23 ms
[2026-05-23 08:20:22] [INFO ] Flatten gal took : 22 ms
[2026-05-23 08:20:22] [INFO ] Time to serialize gal into /tmp/LTL1729455984523261960.gal : 5 ms
[2026-05-23 08:20:22] [INFO ] Time to serialize properties into /tmp/LTL15604930004724816806.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1729455984523261960.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4758282296365043233.hoa' '-atoms' '/tmp/LTL15604930004724816806.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15604930004724816806.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4758282296365043233.hoa
Detected timeout of ITS tools.
[2026-05-23 08:20:37] [INFO ] Flatten gal took : 25 ms
[2026-05-23 08:20:37] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:20:37] [INFO ] Time to serialize gal into /tmp/LTL10579367327446298398.gal : 5 ms
[2026-05-23 08:20:37] [INFO ] Time to serialize properties into /tmp/LTL7103215809726892071.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10579367327446298398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7103215809726892071.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(p187==1)"))||((F((G(F("(p588!=1)")))||((F("(p588!=1)"))&&(X("(p508!=1)")))))&&((X("(p588!=1)"))U((X(G("(p588!=1)")))||((X("(p5...188
Formula 0 simplified : F!"(p187==1)" & (G(FG!"(p588!=1)" & (G!"(p588!=1)" | X!"(p508!=1)")) | (X!"(p588!=1)" R (XF!"(p588!=1)" & (X!"(p588!=1)" | F!"(p542!...163
Detected timeout of ITS tools.
[2026-05-23 08:20:52] [INFO ] Flatten gal took : 21 ms
[2026-05-23 08:20:52] [INFO ] Applying decomposition
[2026-05-23 08:20:52] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11569280692913670810.txt' '-o' '/tmp/graph11569280692913670810.bin' '-w' '/tmp/graph11569280692913670810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11569280692913670810.bin' '-l' '-1' '-v' '-w' '/tmp/graph11569280692913670810.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:20:52] [INFO ] Decomposing Gal with order
[2026-05-23 08:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:20:52] [INFO ] Removed a total of 403 redundant transitions.
[2026-05-23 08:20:52] [INFO ] Flatten gal took : 88 ms
[2026-05-23 08:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 16 ms.
[2026-05-23 08:20:52] [INFO ] Time to serialize gal into /tmp/LTL16846207040032177293.gal : 7 ms
[2026-05-23 08:20:52] [INFO ] Time to serialize properties into /tmp/LTL2901436454362712863.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16846207040032177293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2901436454362712863.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("(i1.u21.p187==1)"))||((F((G(F("(i14.u109.p588!=1)")))||((F("(i14.u109.p588!=1)"))&&(X("(i8.u110.p508!=1)")))))&&((X("(i14.u109....256
Formula 0 simplified : F!"(i1.u21.p187==1)" & (G(FG!"(i14.u109.p588!=1)" & (G!"(i14.u109.p588!=1)" | X!"(i8.u110.p508!=1)")) | (X!"(i14.u109.p588!=1)" R (X...231
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t81, t140, t150, t208, t220, t235, t239, t249, t322, t454, t490, t547, t579, i0.t45...941
Computing Next relation with stutter on 705599 deadlock states
116 unique states visited
45 strongly connected components in search stack
123 transitions explored
110 items max in DFS search stack
462 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.67723,164192,1,0,257371,11140,7177,892759,579,82526,403199
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-16-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CO4-PT-16-LTLFireability-05 finished in 193466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Graph (trivial) has 458 edges and 425 vertex of which 2 / 425 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 923 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 419 transition count 458
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 158 rules applied. Total rules applied 313 place count 266 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 314 place count 265 transition count 453
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 314 place count 265 transition count 406
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 408 place count 218 transition count 406
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 413 place count 213 transition count 398
Iterating global reduction 3 with 5 rules applied. Total rules applied 418 place count 213 transition count 398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 418 place count 213 transition count 396
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 422 place count 211 transition count 396
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 424 place count 209 transition count 393
Iterating global reduction 3 with 2 rules applied. Total rules applied 426 place count 209 transition count 393
Performed 63 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
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 552 place count 146 transition count 314
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 16 rules applied. Total rules applied 568 place count 146 transition count 298
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 574 place count 143 transition count 295
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 579 place count 138 transition count 285
Iterating global reduction 5 with 5 rules applied. Total rules applied 584 place count 138 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 585 place count 138 transition count 284
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 591 place count 135 transition count 281
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 673 place count 94 transition count 326
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 694 place count 94 transition count 305
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 721 place count 67 transition count 197
Iterating global reduction 7 with 27 rules applied. Total rules applied 748 place count 67 transition count 197
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 766 place count 67 transition count 179
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 773 place count 60 transition count 141
Iterating global reduction 8 with 7 rules applied. Total rules applied 780 place count 60 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 785 place count 60 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 797 place count 60 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 799 place count 58 transition count 122
Applied a total of 799 rules in 95 ms. Remains 58 /425 variables (removed 367) and now considering 122/618 (removed 496) transitions.
[2026-05-23 08:20:58] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14284054420469218109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16494622498993932978.kers'
[2026-05-23 08:20:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14284054420469218109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16494622498993932978.kers]
Normalized transition count is 104 out of 105 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 58 cols 306 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-23 08:20:58] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16494622498993932978.kers
Total runtime 1 ms.
[2026-05-23 08:20:58] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 08:20:58] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
[2026-05-23 08:20:58] [INFO ] Invariant cache hit.
[2026-05-23 08:20:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:20:58] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2026-05-23 08:20:58] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2026-05-23 08:20:58] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
[2026-05-23 08:20:58] [INFO ] Invariant cache hit.
[2026-05-23 08:20:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 104/162 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/163 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 65 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2440 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 104/162 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 99/163 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/163 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 164 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3826 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6281ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 6282ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/425 places, 122/618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6489 ms. Remains : 58/425 places, 122/618 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-06
Stuttering criterion allowed to conclude after 6067 steps with 492 reset in 24 ms.
FORMULA CO4-PT-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-06 finished in 6628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Graph (trivial) has 456 edges and 425 vertex of which 2 / 425 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 923 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 419 transition count 458
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 158 rules applied. Total rules applied 313 place count 266 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 314 place count 265 transition count 453
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 314 place count 265 transition count 407
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 406 place count 219 transition count 407
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 411 place count 214 transition count 399
Iterating global reduction 3 with 5 rules applied. Total rules applied 416 place count 214 transition count 399
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 416 place count 214 transition count 397
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 420 place count 212 transition count 397
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 422 place count 210 transition count 394
Iterating global reduction 3 with 2 rules applied. Total rules applied 424 place count 210 transition count 394
Performed 64 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 552 place count 146 transition count 314
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 16 rules applied. Total rules applied 568 place count 146 transition count 298
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 574 place count 143 transition count 295
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 579 place count 138 transition count 285
Iterating global reduction 5 with 5 rules applied. Total rules applied 584 place count 138 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 585 place count 138 transition count 284
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 591 place count 135 transition count 281
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 673 place count 94 transition count 327
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 694 place count 94 transition count 306
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 722 place count 66 transition count 194
Iterating global reduction 7 with 28 rules applied. Total rules applied 750 place count 66 transition count 194
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 769 place count 66 transition count 175
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 776 place count 59 transition count 137
Iterating global reduction 8 with 7 rules applied. Total rules applied 783 place count 59 transition count 137
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 788 place count 59 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 790 place count 58 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 809 place count 58 transition count 130
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 811 place count 56 transition count 128
Applied a total of 811 rules in 66 ms. Remains 56 /425 variables (removed 369) and now considering 128/618 (removed 490) transitions.
[2026-05-23 08:21:05] [INFO ] Flow matrix only has 100 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-362266370839980954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16977048229586050925.kers'
[2026-05-23 08:21:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-362266370839980954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16977048229586050925.kers]
Normalized transition count is 99 out of 100 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 99 rows 56 cols 301 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-23 08:21:05] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16977048229586050925.kers
Total runtime 0 ms.
[2026-05-23 08:21:05] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-23 08:21:05] [INFO ] Flow matrix only has 100 transitions (discarded 28 similar events)
[2026-05-23 08:21:05] [INFO ] Invariant cache hit.
[2026-05-23 08:21:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:21:05] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2026-05-23 08:21:05] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-23 08:21:05] [INFO ] Flow matrix only has 100 transitions (discarded 28 similar events)
[2026-05-23 08:21:05] [INFO ] Invariant cache hit.
[2026-05-23 08:21:05] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 99/155 variables, 56/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 64 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2834 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 99/155 variables, 56/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 106/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/156 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 170 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4701 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7549ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7549ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/425 places, 128/618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7730 ms. Remains : 56/425 places, 128/618 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-07
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-07 finished in 7808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X((X(G(p1))||(!p1&&X((!p1 U (!p0||G(!p1))))))))))'
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 416 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 416 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 416 transition count 604
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 412 transition count 599
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 412 transition count 599
Applied a total of 28 rules in 20 ms. Remains 412 /425 variables (removed 13) and now considering 599/618 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15905266484972265700.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5491470009292723373.kers'
[2026-05-23 08:21:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15905266484972265700.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5491470009292723373.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 599 rows 412 cols 1604 entries
Finished phase 1 with 407 SingleSign rule and 0 generalized
[2026-05-23 08:21:13] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5491470009292723373.kers
Total runtime 5 ms.
[2026-05-23 08:21:13] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 08:21:13] [INFO ] Invariant cache hit.
[2026-05-23 08:21:13] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2026-05-23 08:21:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1011 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 423 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1011 variables, 412/423 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1011 variables, 598/1021 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 1021 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 412/425 places, 599/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60516 ms. Remains : 412/425 places, 599/618 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X((X(G(p1))||(!p1&&X((!p1 U (!p0||G(!p1))))))))))'
Stuttering acceptance computed with spot in 422 ms :[false, false, (NOT p1), false, true, (AND (NOT p0) (NOT p1)), false, false, (AND p0 p1), false, (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-08
Product exploration explored 100000 steps with 561 reset in 119 ms.
Product exploration explored 100000 steps with 880 reset in 127 ms.
Computed a total of 20 stabilizing places and 35 stable transitions
Graph (complete) has 899 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 35 stable transitions
Detected a total of 20/412 stabilizing places and 35/599 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 14 factoid took 69 ms. Reduced automaton from 11 states, 26 edges and 2 AP (stutter sensitive) to 8 states, 22 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (848 resets) in 181 ms. (219 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (156 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (157 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (157 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
[2026-05-23 08:22:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 110/117 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 13/130 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 18/148 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 300/448 variables, 122/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 341/789 variables, 150/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 176/965 variables, 101/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/965 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 36/1001 variables, 22/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1001 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 10/1011 variables, 6/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1011 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1011 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 417 constraints, problems are : Problem set: 0 solved, 3 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 110/117 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 13/130 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/148 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 300/448 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 341/789 variables, 150/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 176/965 variables, 101/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/965 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 36/1001 variables, 22/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1001 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 10/1011 variables, 6/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1011 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1011 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 420 constraints, problems are : Problem set: 0 solved, 3 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1271ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 18 ms.
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 599/599 transitions.
Graph (trivial) has 443 edges and 412 vertex of which 2 / 412 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 897 edges and 411 vertex of which 389 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 389 transition count 418
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 145 rules applied. Total rules applied 306 place count 248 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 307 place count 247 transition count 414
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 307 place count 247 transition count 363
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 409 place count 196 transition count 363
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 412 place count 193 transition count 360
Iterating global reduction 3 with 3 rules applied. Total rules applied 415 place count 193 transition count 360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 418 place count 193 transition count 357
Performed 60 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 538 place count 133 transition count 282
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 14 rules applied. Total rules applied 552 place count 133 transition count 268
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 556 place count 131 transition count 266
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 560 place count 127 transition count 258
Iterating global reduction 6 with 4 rules applied. Total rules applied 564 place count 127 transition count 258
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 572 place count 123 transition count 254
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 573 place count 123 transition count 253
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 574 place count 122 transition count 251
Iterating global reduction 7 with 1 rules applied. Total rules applied 575 place count 122 transition count 251
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 653 place count 83 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 7 with 82 rules applied. Total rules applied 735 place count 83 transition count 210
Discarding 29 places :
Symmetric choice reduction at 8 with 29 rule applications. Total rules 764 place count 54 transition count 141
Iterating global reduction 8 with 29 rules applied. Total rules applied 793 place count 54 transition count 141
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 814 place count 54 transition count 120
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 821 place count 47 transition count 91
Iterating global reduction 9 with 7 rules applied. Total rules applied 828 place count 47 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 833 place count 47 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 835 place count 46 transition count 101
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 838 place count 46 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 848 place count 46 transition count 88
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 849 place count 45 transition count 86
Iterating global reduction 11 with 1 rules applied. Total rules applied 850 place count 45 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 851 place count 45 transition count 85
Free-agglomeration rule applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 862 place count 45 transition count 74
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 875 place count 34 transition count 72
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 878 place count 34 transition count 72
Graph (complete) has 137 edges and 34 vertex of which 33 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 13 with 1 rules applied. Total rules applied 879 place count 33 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 882 place count 33 transition count 69
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 885 place count 33 transition count 69
Graph (complete) has 129 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 15 with 1 rules applied. Total rules applied 886 place count 32 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 889 place count 32 transition count 66
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 892 place count 32 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 893 place count 31 transition count 65
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 t82.t547.t80.t79 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 17 edges and 27 vertex of which 5 / 27 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 3 rules applied. Total rules applied 896 place count 24 transition count 63
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 17 edges and 23 vertex of which 6 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 18 with 10 rules applied. Total rules applied 906 place count 18 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 19 with 23 rules applied. Total rules applied 929 place count 18 transition count 32
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 930 place count 17 transition count 30
Iterating global reduction 20 with 1 rules applied. Total rules applied 931 place count 17 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 932 place count 17 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 3 rules applied. Total rules applied 935 place count 15 transition count 28
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 936 place count 15 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 22 with 8 rules applied. Total rules applied 944 place count 15 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 945 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 946 place count 14 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 947 place count 14 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 948 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 949 place count 13 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 950 place count 13 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 951 place count 13 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 953 place count 12 transition count 13
Applied a total of 953 rules in 44 ms. Remains 12 /412 variables (removed 400) and now considering 13/599 (removed 586) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 12/412 places, 13/599 transitions.
RANDOM walk for 13357 steps (3 resets) in 15 ms. (834 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G p1)
Knowledge based reduction with 14 factoid took 66 ms. Proved property starting from automaton with 8 states, 22 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 1606 ms.
FORMULA CO4-PT-16-LTLFireability-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property CO4-PT-16-LTLFireability-08 finished in 62842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 5 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 416 transition count 607
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 416 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 416 transition count 605
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 411 transition count 599
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 411 transition count 599
Applied a total of 30 rules in 19 ms. Remains 411 /425 variables (removed 14) and now considering 599/618 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7802003386211387016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11778208084607940957.kers'
[2026-05-23 08:22:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7802003386211387016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11778208084607940957.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 599 rows 411 cols 1605 entries
Finished phase 1 with 406 SingleSign rule and 0 generalized
[2026-05-23 08:22:16] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11778208084607940957.kers
Total runtime 2 ms.
[2026-05-23 08:22:16] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-23 08:22:16] [INFO ] Invariant cache hit.
[2026-05-23 08:22:16] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2026-05-23 08:22:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (OVERLAPS) 599/1010 variables, 411/416 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 419 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (OVERLAPS) 599/1010 variables, 411/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1018 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 411/425 places, 599/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60489 ms. Remains : 411/425 places, 599/618 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-16-LTLFireability-09
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-09 finished in 60638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Graph (trivial) has 454 edges and 425 vertex of which 2 / 425 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 923 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 152 place count 419 transition count 461
Reduce places removed 150 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 155 rules applied. Total rules applied 307 place count 269 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 308 place count 268 transition count 456
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 308 place count 268 transition count 409
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 402 place count 221 transition count 409
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 406 place count 217 transition count 403
Iterating global reduction 3 with 4 rules applied. Total rules applied 410 place count 217 transition count 403
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 410 place count 217 transition count 401
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 414 place count 215 transition count 401
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 416 place count 213 transition count 398
Iterating global reduction 3 with 2 rules applied. Total rules applied 418 place count 213 transition count 398
Performed 64 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 546 place count 149 transition count 318
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 15 rules applied. Total rules applied 561 place count 149 transition count 303
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 565 place count 147 transition count 301
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 569 place count 143 transition count 293
Iterating global reduction 5 with 4 rules applied. Total rules applied 573 place count 143 transition count 293
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 577 place count 141 transition count 291
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 661 place count 99 transition count 337
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 682 place count 99 transition count 316
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 710 place count 71 transition count 204
Iterating global reduction 6 with 28 rules applied. Total rules applied 738 place count 71 transition count 204
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 757 place count 71 transition count 185
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 764 place count 64 transition count 147
Iterating global reduction 7 with 7 rules applied. Total rules applied 771 place count 64 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 776 place count 64 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 778 place count 63 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 793 place count 63 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 795 place count 61 transition count 133
Applied a total of 795 rules in 51 ms. Remains 61 /425 variables (removed 364) and now considering 133/618 (removed 485) transitions.
[2026-05-23 08:23:16] [INFO ] Flow matrix only has 112 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4185020760343183074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8171100388959476573.kers'
[2026-05-23 08:23:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4185020760343183074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8171100388959476573.kers]
Normalized transition count is 111 out of 112 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 61 cols 323 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-23 08:23:16] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8171100388959476573.kers
Total runtime 0 ms.
[2026-05-23 08:23:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 08:23:16] [INFO ] Flow matrix only has 112 transitions (discarded 21 similar events)
[2026-05-23 08:23:16] [INFO ] Invariant cache hit.
[2026-05-23 08:23:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:23:16] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2026-05-23 08:23:16] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-23 08:23:16] [INFO ] Flow matrix only has 112 transitions (discarded 21 similar events)
[2026-05-23 08:23:16] [INFO ] Invariant cache hit.
[2026-05-23 08:23:16] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 111/172 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/173 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 69 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2769 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 111/172 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 110/178 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/173 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/173 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 179 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4182 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6962ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6962ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/425 places, 133/618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7135 ms. Remains : 61/425 places, 133/618 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-11
Product exploration explored 100000 steps with 75 reset in 160 ms.
Product exploration explored 100000 steps with 234 reset in 80 ms.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge based reduction with 13 factoid took 49 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (3265 resets) in 369 ms. (108 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (278 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (273 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (275 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
[2026-05-23 08:23:24] [INFO ] Flow matrix only has 112 transitions (discarded 21 similar events)
[2026-05-23 08:23:24] [INFO ] Invariant cache hit.
[2026-05-23 08:23:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/46 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/106 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/108 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 14/122 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 30/152 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 20/172 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/173 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/173 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/173 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 69 constraints, problems are : Problem set: 0 solved, 3 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/46 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 60/106 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/108 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 14/122 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 30/152 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 20/172 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/172 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/173 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/173 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 72 constraints, problems are : Problem set: 0 solved, 3 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 11 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=3 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 3 ms.
Negative knowledge disproves property using: (G (OR p0 p1))
Knowledge based reduction with 13 factoid took 41 ms. Proved property starting from automaton with 4 states, 9 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 646 ms.
FORMULA CO4-PT-16-LTLFireability-11 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property CO4-PT-16-LTLFireability-11 finished in 8175 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 3 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Graph (trivial) has 451 edges and 425 vertex of which 2 / 425 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 923 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 419 transition count 463
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 153 rules applied. Total rules applied 303 place count 271 transition count 458
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 308 place count 270 transition count 454
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 312 place count 266 transition count 454
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 312 place count 266 transition count 408
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 404 place count 220 transition count 408
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 409 place count 215 transition count 400
Iterating global reduction 4 with 5 rules applied. Total rules applied 414 place count 215 transition count 400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 414 place count 215 transition count 398
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 418 place count 213 transition count 398
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 420 place count 211 transition count 395
Iterating global reduction 4 with 2 rules applied. Total rules applied 422 place count 211 transition count 395
Performed 62 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 546 place count 149 transition count 317
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 16 rules applied. Total rules applied 562 place count 149 transition count 301
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 568 place count 146 transition count 298
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 573 place count 141 transition count 288
Iterating global reduction 6 with 5 rules applied. Total rules applied 578 place count 141 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 579 place count 141 transition count 287
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 585 place count 138 transition count 284
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 667 place count 97 transition count 330
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 688 place count 97 transition count 309
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 716 place count 69 transition count 197
Iterating global reduction 8 with 28 rules applied. Total rules applied 744 place count 69 transition count 197
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 763 place count 69 transition count 178
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 769 place count 63 transition count 146
Iterating global reduction 9 with 6 rules applied. Total rules applied 775 place count 63 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 779 place count 63 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 781 place count 62 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 10 with 17 rules applied. Total rules applied 798 place count 62 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 800 place count 60 transition count 140
Applied a total of 800 rules in 54 ms. Remains 60 /425 variables (removed 365) and now considering 140/618 (removed 478) transitions.
[2026-05-23 08:23:24] [INFO ] Flow matrix only has 120 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11561678787292376416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9914511248169162765.kers'
[2026-05-23 08:23:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11561678787292376416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9914511248169162765.kers]
Normalized transition count is 119 out of 120 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 60 cols 399 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-23 08:23:24] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9914511248169162765.kers
Total runtime 3 ms.
[2026-05-23 08:23:24] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 08:23:24] [INFO ] Flow matrix only has 120 transitions (discarded 20 similar events)
[2026-05-23 08:23:24] [INFO ] Invariant cache hit.
[2026-05-23 08:23:24] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-23 08:23:24] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2026-05-23 08:23:24] [INFO ] Redundant transitions in 2 ms returned []
Running 126 sub problems to find dead transitions.
[2026-05-23 08:23:24] [INFO ] Flow matrix only has 120 transitions (discarded 20 similar events)
[2026-05-23 08:23:24] [INFO ] Invariant cache hit.
[2026-05-23 08:23:24] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 119/179 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 80 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5164 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 119/179 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 126/205 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 1/180 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 206 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5800 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10995ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10995ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/425 places, 140/618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11164 ms. Remains : 60/425 places, 140/618 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 44 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-12
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-12 finished in 11240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&F(p1)&&X(p2)))))'
Support contains 3 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 416 transition count 607
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 416 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 416 transition count 605
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 412 transition count 600
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 412 transition count 600
Applied a total of 28 rules in 27 ms. Remains 412 /425 variables (removed 13) and now considering 600/618 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4045156099255522484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12737897630428637674.kers'
[2026-05-23 08:23:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4045156099255522484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12737897630428637674.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 600 rows 412 cols 1607 entries
Finished phase 1 with 407 SingleSign rule and 0 generalized
[2026-05-23 08:23:36] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-12737897630428637674.kers
Total runtime 9 ms.
[2026-05-23 08:23:36] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-23 08:23:36] [INFO ] Invariant cache hit.
[2026-05-23 08:23:36] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2026-05-23 08:23:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/1012 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 419 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (OVERLAPS) 600/1012 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 599/1019 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1019 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 412/425 places, 600/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60481 ms. Remains : 412/425 places, 600/618 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&F(p1)&&X(p2)))))'
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CO4-PT-16-LTLFireability-13
Stuttering criterion allowed to conclude after 52 steps with 1 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-13 finished in 60765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X(p2)&&p1))))'
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 416 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 416 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 416 transition count 605
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 411 transition count 599
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 411 transition count 599
Applied a total of 29 rules in 19 ms. Remains 411 /425 variables (removed 14) and now considering 599/618 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6225912820089352959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2010816979788034077.kers'
[2026-05-23 08:24:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6225912820089352959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2010816979788034077.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 599 rows 411 cols 1601 entries
Finished phase 1 with 406 SingleSign rule and 0 generalized
[2026-05-23 08:24:36] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2010816979788034077.kers
Total runtime 3 ms.
[2026-05-23 08:24:36] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-23 08:24:36] [INFO ] Invariant cache hit.
[2026-05-23 08:24:37] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2026-05-23 08:24:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (OVERLAPS) 599/1010 variables, 411/416 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 419 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (OVERLAPS) 599/1010 variables, 411/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1018 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 411/425 places, 599/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60532 ms. Remains : 411/425 places, 599/618 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X(p2)&&p1))))'
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-14 finished in 60756 ms.
All properties solved by simple procedures.
Total runtime 601477 ms.
BK_STOP 1779524737583
--------------------
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-16"
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-16, 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-177946967700404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-16.tgz
mv CO4-PT-16 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;