Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000284.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyB-PT-B01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 231K 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 MedleyB-PT-B01-LTLFireability-00
FORMULA_NAME MedleyB-PT-B01-LTLFireability-01
FORMULA_NAME MedleyB-PT-B01-LTLFireability-02
FORMULA_NAME MedleyB-PT-B01-LTLFireability-03
FORMULA_NAME MedleyB-PT-B01-LTLFireability-04
FORMULA_NAME MedleyB-PT-B01-LTLFireability-05
FORMULA_NAME MedleyB-PT-B01-LTLFireability-06
FORMULA_NAME MedleyB-PT-B01-LTLFireability-07
FORMULA_NAME MedleyB-PT-B01-LTLFireability-08
FORMULA_NAME MedleyB-PT-B01-LTLFireability-09
FORMULA_NAME MedleyB-PT-B01-LTLFireability-10
FORMULA_NAME MedleyB-PT-B01-LTLFireability-11
FORMULA_NAME MedleyB-PT-B01-LTLFireability-12
FORMULA_NAME MedleyB-PT-B01-LTLFireability-13
FORMULA_NAME MedleyB-PT-B01-LTLFireability-14
FORMULA_NAME MedleyB-PT-B01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779704601440

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 10:23:22] [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-25 10:23:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:23:22] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2026-05-25 10:23:22] [INFO ] Transformed 925 places.
[2026-05-25 10:23:22] [INFO ] Transformed 1037 transitions.
[2026-05-25 10:23:22] [INFO ] Found NUPN structural information;
[2026-05-25 10:23:22] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyB-PT-B01-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 925 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 855 transition count 967
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 855 transition count 967
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 182 place count 813 transition count 925
Iterating global reduction 0 with 42 rules applied. Total rules applied 224 place count 813 transition count 925
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 244 place count 793 transition count 905
Iterating global reduction 0 with 20 rules applied. Total rules applied 264 place count 793 transition count 905
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 283 place count 774 transition count 886
Iterating global reduction 0 with 19 rules applied. Total rules applied 302 place count 774 transition count 886
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 317 place count 759 transition count 871
Iterating global reduction 0 with 15 rules applied. Total rules applied 332 place count 759 transition count 871
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 347 place count 744 transition count 856
Iterating global reduction 0 with 15 rules applied. Total rules applied 362 place count 744 transition count 856
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 377 place count 729 transition count 841
Iterating global reduction 0 with 15 rules applied. Total rules applied 392 place count 729 transition count 841
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 404 place count 717 transition count 829
Iterating global reduction 0 with 12 rules applied. Total rules applied 416 place count 717 transition count 829
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 426 place count 707 transition count 819
Iterating global reduction 0 with 10 rules applied. Total rules applied 436 place count 707 transition count 819
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 443 place count 700 transition count 812
Iterating global reduction 0 with 7 rules applied. Total rules applied 450 place count 700 transition count 812
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 452 place count 700 transition count 810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 453 place count 699 transition count 809
Iterating global reduction 1 with 1 rules applied. Total rules applied 454 place count 699 transition count 809
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 455 place count 698 transition count 808
Iterating global reduction 1 with 1 rules applied. Total rules applied 456 place count 698 transition count 808
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 457 place count 697 transition count 807
Iterating global reduction 1 with 1 rules applied. Total rules applied 458 place count 697 transition count 807
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 459 place count 696 transition count 806
Iterating global reduction 1 with 1 rules applied. Total rules applied 460 place count 696 transition count 806
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 461 place count 695 transition count 805
Iterating global reduction 1 with 1 rules applied. Total rules applied 462 place count 695 transition count 805
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 463 place count 694 transition count 804
Iterating global reduction 1 with 1 rules applied. Total rules applied 464 place count 694 transition count 804
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 465 place count 693 transition count 803
Iterating global reduction 1 with 1 rules applied. Total rules applied 466 place count 693 transition count 803
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 467 place count 692 transition count 802
Iterating global reduction 1 with 1 rules applied. Total rules applied 468 place count 692 transition count 802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 469 place count 691 transition count 801
Iterating global reduction 1 with 1 rules applied. Total rules applied 470 place count 691 transition count 801
Applied a total of 470 rules in 957 ms. Remains 691 /925 variables (removed 234) and now considering 801/1037 (removed 236) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12036523971753197078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11508386928594516541.kers'
[2026-05-25 10:23:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12036523971753197078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11508386928594516541.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 801 rows 691 cols 1955 entries
Finished phase 1 with 687 SingleSign rule and 0 generalized
[2026-05-25 10:23:24] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11508386928594516541.kers
Total runtime 5 ms.
[2026-05-25 10:23:24] [INFO ] Implicit Places using invariants in 574 ms returned []
[2026-05-25 10:23:24] [INFO ] Invariant cache hit.
[2026-05-25 10:23:25] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
Running 800 sub problems to find dead transitions.
[2026-05-25 10:23:25] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/690 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
SMT process timed out in 30211ms, After SMT, problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 30243ms
Starting structural reductions in LTL mode, iteration 1 : 691/925 places, 801/1037 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32750 ms. Remains : 691/925 places, 801/1037 transitions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Applied a total of 0 rules in 19 ms. Remains 691 /691 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2026-05-25 10:23:55] [INFO ] Invariant cache hit.
[2026-05-25 10:23:56] [INFO ] Implicit Places using invariants in 466 ms returned []
[2026-05-25 10:23:56] [INFO ] Invariant cache hit.
[2026-05-25 10:23:57] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1174 ms. Remains : 691/691 places, 801/801 transitions.
Support contains 45 out of 691 places after structural reductions.
[2026-05-25 10:23:57] [INFO ] Flatten gal took : 79 ms
[2026-05-25 10:23:57] [INFO ] Flatten gal took : 36 ms
[2026-05-25 10:23:57] [INFO ] Input system was already deterministic with 801 transitions.
RANDOM walk for 40000 steps (655 resets) in 1606 ms. (24 steps per ms) remains 24/40 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (16 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
[2026-05-25 10:23:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 668/691 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/691 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 801/1492 variables, 691/702 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1492/1492 variables, and 702 constraints, problems are : Problem set: 2 solved, 18 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 691/691 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 671/691 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/691 variables, 7/11 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 4/15 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 801/1492 variables, 691/706 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1492 variables, 17/723 constraints. Problems are: Problem set: 3 solved, 17 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1492/1492 variables, and 723 constraints, problems are : Problem set: 3 solved, 17 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 691/691 constraints, PredecessorRefiner: 17/20 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10075ms problems are : Problem set: 3 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 801/801 transitions.
Graph (trivial) has 651 edges and 691 vertex of which 43 / 691 are part of one of the 8 SCC in 13 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 949 edges and 656 vertex of which 653 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 468 rules applied. Total rules applied 470 place count 653 transition count 285
Reduce places removed 465 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 471 rules applied. Total rules applied 941 place count 188 transition count 279
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 948 place count 186 transition count 274
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 953 place count 181 transition count 274
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 953 place count 181 transition count 235
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1031 place count 142 transition count 235
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1033 place count 140 transition count 233
Iterating global reduction 4 with 2 rules applied. Total rules applied 1035 place count 140 transition count 233
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1081 place count 117 transition count 210
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1086 place count 117 transition count 205
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1102 place count 101 transition count 152
Iterating global reduction 5 with 16 rules applied. Total rules applied 1118 place count 101 transition count 152
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1125 place count 101 transition count 145
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1131 place count 95 transition count 139
Iterating global reduction 6 with 6 rules applied. Total rules applied 1137 place count 95 transition count 139
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1141 place count 91 transition count 135
Iterating global reduction 6 with 4 rules applied. Total rules applied 1145 place count 91 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1147 place count 91 transition count 133
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1157 place count 86 transition count 128
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1167 place count 81 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1168 place count 81 transition count 152
Free-agglomeration rule applied 19 times with reduction of 3 identical transitions.
Iterating global reduction 8 with 19 rules applied. Total rules applied 1187 place count 81 transition count 130
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 1210 place count 62 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 1230 place count 62 transition count 106
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1233 place count 62 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1234 place count 62 transition count 105
Applied a total of 1234 rules in 145 ms. Remains 62 /691 variables (removed 629) and now considering 105/801 (removed 696) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 62/691 places, 105/801 transitions.
RANDOM walk for 25536 steps (2368 resets) in 538 ms. (47 steps per ms) remains 0/17 properties
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Computed a total of 131 stabilizing places and 137 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0) U (p1&&X(X(p2))))||F(p3))))'
Support contains 4 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 677 transition count 787
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 677 transition count 787
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 666 transition count 776
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 666 transition count 776
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 657 transition count 767
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 657 transition count 767
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 657 transition count 766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 650 transition count 759
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 650 transition count 759
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 643 transition count 752
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 643 transition count 752
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 636 transition count 745
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 636 transition count 745
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 630 transition count 739
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 630 transition count 739
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 129 place count 624 transition count 733
Iterating global reduction 1 with 6 rules applied. Total rules applied 135 place count 624 transition count 733
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 140 place count 619 transition count 728
Iterating global reduction 1 with 5 rules applied. Total rules applied 145 place count 619 transition count 728
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 150 place count 614 transition count 723
Iterating global reduction 1 with 5 rules applied. Total rules applied 155 place count 614 transition count 723
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 159 place count 610 transition count 719
Iterating global reduction 1 with 4 rules applied. Total rules applied 163 place count 610 transition count 719
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 166 place count 607 transition count 716
Iterating global reduction 1 with 3 rules applied. Total rules applied 169 place count 607 transition count 716
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 171 place count 605 transition count 714
Iterating global reduction 1 with 2 rules applied. Total rules applied 173 place count 605 transition count 714
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 175 place count 603 transition count 712
Iterating global reduction 1 with 2 rules applied. Total rules applied 177 place count 603 transition count 712
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 179 place count 601 transition count 710
Iterating global reduction 1 with 2 rules applied. Total rules applied 181 place count 601 transition count 710
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 183 place count 601 transition count 708
Applied a total of 183 rules in 470 ms. Remains 601 /691 variables (removed 90) and now considering 708/801 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-814075971448717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2763226584619114181.kers'
[2026-05-25 10:24:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-814075971448717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2763226584619114181.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 708 rows 601 cols 1751 entries
Finished phase 1 with 597 SingleSign rule and 0 generalized
[2026-05-25 10:24:09] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2763226584619114181.kers
Total runtime 4 ms.
[2026-05-25 10:24:10] [INFO ] Implicit Places using invariants in 401 ms returned []
[2026-05-25 10:24:10] [INFO ] Invariant cache hit.
[2026-05-25 10:24:10] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
Running 707 sub problems to find dead transitions.
[2026-05-25 10:24:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 707 unsolved
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 0 solved, 707 unsolved
Search for dead transitions found 0 dead transitions in 30133ms
Starting structural reductions in LTL mode, iteration 1 : 601/691 places, 708/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31478 ms. Remains : 601/691 places, 708/801 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 (p1&&X(X(p2))))||F(p3))))'
Stuttering acceptance computed with spot in 818 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-00
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 5 ms.
FORMULA MedleyB-PT-B01-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-00 finished in 32493 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)||X(G(!p1))))'
Support contains 3 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 676 transition count 786
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 676 transition count 786
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 664 transition count 774
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 664 transition count 774
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 654 transition count 764
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 654 transition count 764
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 654 transition count 763
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 646 transition count 755
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 646 transition count 755
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 99 place count 638 transition count 747
Iterating global reduction 1 with 8 rules applied. Total rules applied 107 place count 638 transition count 747
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 115 place count 630 transition count 739
Iterating global reduction 1 with 8 rules applied. Total rules applied 123 place count 630 transition count 739
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 130 place count 623 transition count 732
Iterating global reduction 1 with 7 rules applied. Total rules applied 137 place count 623 transition count 732
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 144 place count 616 transition count 725
Iterating global reduction 1 with 7 rules applied. Total rules applied 151 place count 616 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 152 place count 616 transition count 724
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 157 place count 611 transition count 719
Iterating global reduction 2 with 5 rules applied. Total rules applied 162 place count 611 transition count 719
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 167 place count 606 transition count 714
Iterating global reduction 2 with 5 rules applied. Total rules applied 172 place count 606 transition count 714
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 176 place count 602 transition count 710
Iterating global reduction 2 with 4 rules applied. Total rules applied 180 place count 602 transition count 710
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 599 transition count 707
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 599 transition count 707
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 188 place count 597 transition count 705
Iterating global reduction 2 with 2 rules applied. Total rules applied 190 place count 597 transition count 705
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 595 transition count 703
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 595 transition count 703
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 196 place count 593 transition count 701
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 593 transition count 701
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 200 place count 593 transition count 699
Applied a total of 200 rules in 310 ms. Remains 593 /691 variables (removed 98) and now considering 699/801 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10327179712933915406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1555514317148462712.kers'
[2026-05-25 10:24:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10327179712933915406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1555514317148462712.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 699 rows 593 cols 1733 entries
Finished phase 1 with 589 SingleSign rule and 0 generalized
[2026-05-25 10:24:42] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1555514317148462712.kers
Total runtime 10 ms.
[2026-05-25 10:24:42] [INFO ] Implicit Places using invariants in 375 ms returned []
[2026-05-25 10:24:42] [INFO ] Invariant cache hit.
[2026-05-25 10:24:43] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-25 10:24:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1292 variables, and 4 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/1292 variables, and 7 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 593/691 places, 699/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61503 ms. Remains : 593/691 places, 699/801 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)||X(G(p1))))'
Stuttering acceptance computed with spot in 258 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-01
Product exploration explored 100000 steps with 1640 reset in 252 ms.
Product exploration explored 100000 steps with 1645 reset in 210 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge based reduction with 13 factoid took 106 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (661 resets) in 530 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (105 resets) in 226 ms. (176 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (108 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
[2026-05-25 10:25:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 398/401 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/593 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 699/1292 variables, 593/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1292 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1292 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1292/1292 variables, and 597 constraints, problems are : Problem set: 0 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 593/593 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 398/401 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/593 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 699/1292 variables, 593/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1292 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1292 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1292 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1292/1292 variables, and 598 constraints, problems are : Problem set: 0 solved, 1 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 593/593 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 897ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 73 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 9 ms.
Negative knowledge disproves property using: (G (OR p0 p1))
Knowledge based reduction with 13 factoid took 110 ms. Proved property starting from automaton with 4 states, 9 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 1408 ms.
FORMULA MedleyB-PT-B01-LTLFireability-01 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyB-PT-B01-LTLFireability-01 finished in 63684 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))'
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Graph (trivial) has 684 edges and 691 vertex of which 52 / 691 are part of one of the 9 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 486 rules applied. Total rules applied 487 place count 647 transition count 265
Reduce places removed 486 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 496 rules applied. Total rules applied 983 place count 161 transition count 255
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 987 place count 157 transition count 255
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 987 place count 157 transition count 221
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1055 place count 123 transition count 221
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1063 place count 115 transition count 213
Iterating global reduction 3 with 8 rules applied. Total rules applied 1071 place count 115 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1071 place count 115 transition count 212
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1073 place count 114 transition count 212
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1076 place count 111 transition count 209
Iterating global reduction 3 with 3 rules applied. Total rules applied 1079 place count 111 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1080 place count 110 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 1081 place count 110 transition count 208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1082 place count 109 transition count 207
Iterating global reduction 3 with 1 rules applied. Total rules applied 1083 place count 109 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1084 place count 109 transition count 206
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 1126 place count 88 transition count 183
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1145 place count 69 transition count 129
Iterating global reduction 4 with 19 rules applied. Total rules applied 1164 place count 69 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1172 place count 69 transition count 121
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1182 place count 59 transition count 108
Iterating global reduction 5 with 10 rules applied. Total rules applied 1192 place count 59 transition count 108
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1202 place count 49 transition count 95
Iterating global reduction 5 with 10 rules applied. Total rules applied 1212 place count 49 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1216 place count 49 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1230 place count 42 transition count 100
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1231 place count 41 transition count 94
Iterating global reduction 6 with 1 rules applied. Total rules applied 1232 place count 41 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1233 place count 41 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1236 place count 41 transition count 90
Applied a total of 1236 rules in 39 ms. Remains 41 /691 variables (removed 650) and now considering 90/801 (removed 711) transitions.
[2026-05-25 10:25:45] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10956360720419241273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1102242737351664368.kers'
[2026-05-25 10:25:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10956360720419241273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1102242737351664368.kers]
Normalized transition count is 85 out of 86 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 85 rows 40 cols 286 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-25 10:25:45] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1102242737351664368.kers
Total runtime 0 ms.
[2026-05-25 10:25:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 10:25:45] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2026-05-25 10:25:45] [INFO ] Invariant cache hit.
[2026-05-25 10:25:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 10:25:45] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2026-05-25 10:25:45] [INFO ] Redundant transitions in 0 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-25 10:25:45] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2026-05-25 10:25:45] [INFO ] Invariant cache hit.
[2026-05-25 10:25:45] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 85/126 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 67 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3932 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 85/126 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 81/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 1/127 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 149 constraints, problems are : Problem set: 0 solved, 81 unsolved in 6079 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10053ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 10054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/691 places, 90/801 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10201 ms. Remains : 41/691 places, 90/801 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))'
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-02
Product exploration explored 100000 steps with 238 reset in 161 ms.
Product exploration explored 100000 steps with 309 reset in 66 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 43 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (6513 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1028 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4826 steps, run visited all 1 properties in 16 ms. (steps per millisecond=301 )
Probabilistic random walk after 4826 steps, saw 1497 distinct states, run finished after 22 ms. (steps per millisecond=219 ) properties seen :1
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 3 factoid took 34 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 212 ms.
FORMULA MedleyB-PT-B01-LTLFireability-02 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyB-PT-B01-LTLFireability-02 finished in 10755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 677 transition count 787
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 677 transition count 787
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 666 transition count 776
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 666 transition count 776
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 656 transition count 766
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 656 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 656 transition count 765
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 79 place count 648 transition count 757
Iterating global reduction 1 with 8 rules applied. Total rules applied 87 place count 648 transition count 757
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 95 place count 640 transition count 749
Iterating global reduction 1 with 8 rules applied. Total rules applied 103 place count 640 transition count 749
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 111 place count 632 transition count 741
Iterating global reduction 1 with 8 rules applied. Total rules applied 119 place count 632 transition count 741
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 126 place count 625 transition count 734
Iterating global reduction 1 with 7 rules applied. Total rules applied 133 place count 625 transition count 734
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 140 place count 618 transition count 727
Iterating global reduction 1 with 7 rules applied. Total rules applied 147 place count 618 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 148 place count 618 transition count 726
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 153 place count 613 transition count 721
Iterating global reduction 2 with 5 rules applied. Total rules applied 158 place count 613 transition count 721
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 163 place count 608 transition count 716
Iterating global reduction 2 with 5 rules applied. Total rules applied 168 place count 608 transition count 716
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 604 transition count 712
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 604 transition count 712
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 601 transition count 709
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 601 transition count 709
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 184 place count 599 transition count 707
Iterating global reduction 2 with 2 rules applied. Total rules applied 186 place count 599 transition count 707
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 188 place count 597 transition count 705
Iterating global reduction 2 with 2 rules applied. Total rules applied 190 place count 597 transition count 705
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 595 transition count 703
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 595 transition count 703
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 196 place count 595 transition count 701
Applied a total of 196 rules in 234 ms. Remains 595 /691 variables (removed 96) and now considering 701/801 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3310451274169096317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13873958619773205697.kers'
[2026-05-25 10:25:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3310451274169096317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13873958619773205697.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 701 rows 595 cols 1737 entries
Finished phase 1 with 591 SingleSign rule and 0 generalized
[2026-05-25 10:25:56] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13873958619773205697.kers
Total runtime 4 ms.
[2026-05-25 10:25:56] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-25 10:25:56] [INFO ] Invariant cache hit.
[2026-05-25 10:25:57] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2026-05-25 10:25:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (OVERLAPS) 1/595 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/1296 variables, and 4 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/595 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (OVERLAPS) 1/595 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/1296 variables, and 11 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/595 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in LTL mode, iteration 1 : 595/691 places, 701/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61243 ms. Remains : 595/691 places, 701/801 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-03
Product exploration explored 100000 steps with 1231 reset in 123 ms.
Product exploration explored 100000 steps with 1631 reset in 155 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (651 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36864 steps (150 resets) in 31 ms. (1152 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 354 ms.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 701/701 transitions.
Applied a total of 0 rules in 11 ms. Remains 595 /595 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2026-05-25 10:26:58] [INFO ] Invariant cache hit.
[2026-05-25 10:26:58] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-25 10:26:58] [INFO ] Invariant cache hit.
[2026-05-25 10:26:59] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 801 ms. Remains : 595/595 places, 701/701 transitions.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge based reduction with 2 factoid took 35 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 36227 steps (590 resets) in 53 ms. (670 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 42 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 255 ms.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1636 reset in 103 ms.
Product exploration explored 100000 steps with 1634 reset in 100 ms.
Spot run failed in 124 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/ltsmin8396990695941011717
[2026-05-25 10:27:00] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8396990695941011717
Running compilation step : cd /tmp/ltsmin8396990695941011717;'/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 1207 ms.
Running link step : cd /tmp/ltsmin8396990695941011717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8396990695941011717;'/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/stateBased13737853022638535339.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 701/701 transitions.
Applied a total of 0 rules in 11 ms. Remains 595 /595 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2026-05-25 10:27:15] [INFO ] Invariant cache hit.
[2026-05-25 10:27:15] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-25 10:27:15] [INFO ] Invariant cache hit.
[2026-05-25 10:27:15] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 595/595 places, 701/701 transitions.
Built C files in :
/tmp/ltsmin16694670995232895449
[2026-05-25 10:27:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16694670995232895449
Running compilation step : cd /tmp/ltsmin16694670995232895449;'/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 974 ms.
Running link step : cd /tmp/ltsmin16694670995232895449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16694670995232895449;'/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/stateBased13865194245868285478.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:27:31] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:27:31] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:27:31] [INFO ] Time to serialize gal into /tmp/LTL8652164689368852224.gal : 5 ms
[2026-05-25 10:27:31] [INFO ] Time to serialize properties into /tmp/LTL2943200724851569041.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/LTL8652164689368852224.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9959437788026851050.hoa' '-atoms' '/tmp/LTL2943200724851569041.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...317
Loading property file /tmp/LTL2943200724851569041.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9959437788026851050.hoa
Detected timeout of ITS tools.
[2026-05-25 10:27:46] [INFO ] Flatten gal took : 35 ms
[2026-05-25 10:27:46] [INFO ] Flatten gal took : 28 ms
[2026-05-25 10:27:46] [INFO ] Time to serialize gal into /tmp/LTL14114264955987924467.gal : 4 ms
[2026-05-25 10:27:46] [INFO ] Time to serialize properties into /tmp/LTL5643904780830984048.ltl : 12 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/LTL14114264955987924467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5643904780830984048.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 : !((X(X(G("(p9==0)")))))
Formula 0 simplified : XXF!"(p9==0)"
Detected timeout of ITS tools.
[2026-05-25 10:28:01] [INFO ] Flatten gal took : 26 ms
[2026-05-25 10:28:01] [INFO ] Applying decomposition
[2026-05-25 10:28:01] [INFO ] Flatten gal took : 16 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/graph4753337353541039263.txt' '-o' '/tmp/graph4753337353541039263.bin' '-w' '/tmp/graph4753337353541039263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4753337353541039263.bin' '-l' '-1' '-v' '-w' '/tmp/graph4753337353541039263.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:28:01] [INFO ] Decomposing Gal with order
[2026-05-25 10:28:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:28:01] [INFO ] Removed a total of 391 redundant transitions.
[2026-05-25 10:28:01] [INFO ] Flatten gal took : 103 ms
[2026-05-25 10:28:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 12 ms.
[2026-05-25 10:28:01] [INFO ] Time to serialize gal into /tmp/LTL16549442650772871089.gal : 9 ms
[2026-05-25 10:28:01] [INFO ] Time to serialize properties into /tmp/LTL7909537852785385354.ltl : 0 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/LTL16549442650772871089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7909537852785385354.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 : !((X(X(G("(i0.u4.p9==0)")))))
Formula 0 simplified : XXF!"(i0.u4.p9==0)"
Reverse transition relation is NOT exact ! Due to transitions t70, t115, t171, t229, t414, t453, t564, t565, t566, t623, t639, t640, t647, t650, t655, t658...488
Computing Next relation with stutter on 6260 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
457 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.63434,138488,1,0,234104,456,7013,556204,197,1024,773406
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyB-PT-B01-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyB-PT-B01-LTLFireability-03 finished in 131054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&((p2&&F(p3))||p1))))'
Support contains 3 out of 691 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Graph (trivial) has 679 edges and 691 vertex of which 49 / 691 are part of one of the 9 SCC in 2 ms
Free SCC test removed 40 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 482 transitions
Trivial Post-agglo rules discarded 482 transitions
Performed 482 trivial Post agglomeration. Transition count delta: 482
Iterating post reduction 0 with 482 rules applied. Total rules applied 483 place count 650 transition count 273
Reduce places removed 482 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 492 rules applied. Total rules applied 975 place count 168 transition count 263
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 981 place count 164 transition count 261
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 983 place count 162 transition count 261
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 983 place count 162 transition count 226
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1053 place count 127 transition count 226
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1062 place count 118 transition count 217
Iterating global reduction 4 with 9 rules applied. Total rules applied 1071 place count 118 transition count 217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1071 place count 118 transition count 216
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1073 place count 117 transition count 216
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1077 place count 113 transition count 212
Iterating global reduction 4 with 4 rules applied. Total rules applied 1081 place count 113 transition count 212
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1082 place count 112 transition count 211
Iterating global reduction 4 with 1 rules applied. Total rules applied 1083 place count 112 transition count 211
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1084 place count 111 transition count 210
Iterating global reduction 4 with 1 rules applied. Total rules applied 1085 place count 111 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1086 place count 111 transition count 209
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1126 place count 91 transition count 187
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1143 place count 74 transition count 137
Iterating global reduction 5 with 17 rules applied. Total rules applied 1160 place count 74 transition count 137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1168 place count 74 transition count 129
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1176 place count 66 transition count 120
Iterating global reduction 6 with 8 rules applied. Total rules applied 1184 place count 66 transition count 120
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1192 place count 58 transition count 111
Iterating global reduction 6 with 8 rules applied. Total rules applied 1200 place count 58 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1204 place count 58 transition count 107
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1222 place count 49 transition count 116
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1223 place count 48 transition count 106
Iterating global reduction 7 with 1 rules applied. Total rules applied 1224 place count 48 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1225 place count 48 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1229 place count 48 transition count 101
Applied a total of 1229 rules in 79 ms. Remains 48 /691 variables (removed 643) and now considering 101/801 (removed 700) transitions.
[2026-05-25 10:28:07] [INFO ] Flow matrix only has 95 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13868540175915679606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17429421653484720892.kers'
[2026-05-25 10:28:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13868540175915679606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17429421653484720892.kers]
Normalized transition count is 94 out of 95 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 94 rows 47 cols 307 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 10:28:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17429421653484720892.kers
Total runtime 1 ms.
[2026-05-25 10:28:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 10:28:07] [INFO ] Flow matrix only has 95 transitions (discarded 6 similar events)
[2026-05-25 10:28:07] [INFO ] Invariant cache hit.
[2026-05-25 10:28:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 10:28:07] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2026-05-25 10:28:07] [INFO ] Redundant transitions in 1 ms returned []
Running 92 sub problems to find dead transitions.
[2026-05-25 10:28:07] [INFO ] Flow matrix only has 95 transitions (discarded 6 similar events)
[2026-05-25 10:28:07] [INFO ] Invariant cache hit.
[2026-05-25 10:28:07] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 94/142 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 75 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4978 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 94/142 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 92/166 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 1/143 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (OVERLAPS) 0/143 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 170 constraints, problems are : Problem set: 0 solved, 92 unsolved in 11155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16146ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 16146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/691 places, 101/801 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16418 ms. Remains : 48/691 places, 101/801 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&((p2&&F(p3))||p1))))'
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-04 finished in 16594 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) U X(!p1)) U ((X(p2) U p2) U p3)))'
Support contains 4 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 677 transition count 787
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 677 transition count 787
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 666 transition count 776
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 666 transition count 776
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 658 transition count 768
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 658 transition count 768
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 651 transition count 761
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 651 transition count 761
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 644 transition count 754
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 644 transition count 754
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 637 transition count 747
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 637 transition count 747
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 630 transition count 740
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 630 transition count 740
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 129 place count 623 transition count 733
Iterating global reduction 0 with 7 rules applied. Total rules applied 136 place count 623 transition count 733
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 141 place count 618 transition count 728
Iterating global reduction 0 with 5 rules applied. Total rules applied 146 place count 618 transition count 728
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 151 place count 613 transition count 723
Iterating global reduction 0 with 5 rules applied. Total rules applied 156 place count 613 transition count 723
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 160 place count 609 transition count 719
Iterating global reduction 0 with 4 rules applied. Total rules applied 164 place count 609 transition count 719
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 166 place count 607 transition count 717
Iterating global reduction 0 with 2 rules applied. Total rules applied 168 place count 607 transition count 717
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 169 place count 606 transition count 716
Iterating global reduction 0 with 1 rules applied. Total rules applied 170 place count 606 transition count 716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 171 place count 605 transition count 715
Iterating global reduction 0 with 1 rules applied. Total rules applied 172 place count 605 transition count 715
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 173 place count 604 transition count 714
Iterating global reduction 0 with 1 rules applied. Total rules applied 174 place count 604 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 175 place count 604 transition count 713
Applied a total of 175 rules in 259 ms. Remains 604 /691 variables (removed 87) and now considering 713/801 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10799644454611593167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12628614259641837711.kers'
[2026-05-25 10:28:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10799644454611593167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12628614259641837711.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 713 rows 604 cols 1761 entries
Finished phase 1 with 600 SingleSign rule and 0 generalized
[2026-05-25 10:28:24] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12628614259641837711.kers
Total runtime 4 ms.
[2026-05-25 10:28:24] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-05-25 10:28:24] [INFO ] Invariant cache hit.
[2026-05-25 10:28:25] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
Running 712 sub problems to find dead transitions.
[2026-05-25 10:28:25] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 30120ms
Starting structural reductions in LTL mode, iteration 1 : 604/691 places, 713/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31282 ms. Remains : 604/691 places, 713/801 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) U X(!p1)) U ((X(p2) U p2) U p3)))'
Stuttering acceptance computed with spot in 693 ms :[p3, true, p3, (AND p0 (NOT p1) p3), (AND (NOT p1) p3), (AND p3 p2), (AND (NOT p1) p3), (NOT p1), (NOT p1), (AND p0 (NOT p1) p3), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p1), (AND p0 p1 p3), (AND p3 p2 p0 p1)]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-05
Product exploration explored 100000 steps with 37531 reset in 257 ms.
Product exploration explored 100000 steps with 37440 reset in 223 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge based reduction with 49 factoid took 293 ms. Reduced automaton from 15 states, 60 edges and 4 AP (stutter sensitive) to 15 states, 55 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (664 resets) in 327 ms. (121 steps per ms) remains 28/38 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (15 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (16 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (15 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (15 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (13 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (14 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (15 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (15 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (16 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
[2026-05-25 10:28:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem apf4 is UNSAT
Problem apf23 is UNSAT
Problem apf27 is UNSAT
At refinement iteration 1 (OVERLAPS) 586/590 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 14/604 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 713/1317 variables, 604/608 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1317 variables, 0/608 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/1317 variables, 0/608 constraints. Problems are: Problem set: 3 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1317/1317 variables, and 608 constraints, problems are : Problem set: 3 solved, 25 unsolved in 4789 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 604/604 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 586/590 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 14/604 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 713/1317 variables, 604/608 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1317 variables, 25/633 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1317 variables, 0/633 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/1317 variables, 1/634 constraints. Problems are: Problem set: 3 solved, 25 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1317/1317 variables, and 634 constraints, problems are : Problem set: 3 solved, 25 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 604/604 constraints, PredecessorRefiner: 25/28 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9840ms problems are : Problem set: 3 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 604/604 places, 713/713 transitions.
Graph (trivial) has 598 edges and 604 vertex of which 48 / 604 are part of one of the 9 SCC in 3 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 837 edges and 565 vertex of which 562 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 421 rules applied. Total rules applied 423 place count 562 transition count 238
Reduce places removed 418 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 427 rules applied. Total rules applied 850 place count 144 transition count 229
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 854 place count 141 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 855 place count 140 transition count 228
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 855 place count 140 transition count 192
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 927 place count 104 transition count 192
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 928 place count 104 transition count 191
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 972 place count 82 transition count 169
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 978 place count 82 transition count 163
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 997 place count 63 transition count 107
Iterating global reduction 6 with 19 rules applied. Total rules applied 1016 place count 63 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1025 place count 63 transition count 98
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1034 place count 54 transition count 89
Iterating global reduction 7 with 9 rules applied. Total rules applied 1043 place count 54 transition count 89
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1049 place count 48 transition count 83
Iterating global reduction 7 with 6 rules applied. Total rules applied 1055 place count 48 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1058 place count 48 transition count 80
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 8 with 6 rules applied. Total rules applied 1064 place count 45 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1070 place count 42 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1071 place count 42 transition count 89
Free-agglomeration rule applied 16 times with reduction of 3 identical transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1087 place count 42 transition count 70
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 1109 place count 26 transition count 64
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1112 place count 23 transition count 61
Iterating global reduction 9 with 3 rules applied. Total rules applied 1115 place count 23 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1116 place count 23 transition count 60
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 1118 place count 22 transition count 77
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1130 place count 22 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 1152 place count 22 transition count 43
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1153 place count 22 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1154 place count 22 transition count 42
Applied a total of 1154 rules in 37 ms. Remains 22 /604 variables (removed 582) and now considering 42/713 (removed 671) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 22/604 places, 42/713 transitions.
RANDOM walk for 3534 steps (0 resets) in 8 ms. (392 steps per ms) remains 0/25 properties
Found 3 invariant AP formulas.
Negative knowledge disproves property using: (G (OR (NOT p0) p1 (NOT p3)))
Knowledge based reduction with 52 factoid took 455 ms. Proved property starting from automaton with 15 states, 55 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 10886 ms.
FORMULA MedleyB-PT-B01-LTLFireability-05 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyB-PT-B01-LTLFireability-05 finished in 43413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G((p1&&F(p2))))))'
Support contains 3 out of 691 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Graph (trivial) has 679 edges and 691 vertex of which 52 / 691 are part of one of the 9 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 479 place count 647 transition count 273
Reduce places removed 478 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 488 rules applied. Total rules applied 967 place count 169 transition count 263
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 973 place count 165 transition count 261
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 975 place count 163 transition count 261
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 975 place count 163 transition count 225
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1047 place count 127 transition count 225
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1055 place count 119 transition count 217
Iterating global reduction 4 with 8 rules applied. Total rules applied 1063 place count 119 transition count 217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1063 place count 119 transition count 216
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1065 place count 118 transition count 216
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1069 place count 114 transition count 212
Iterating global reduction 4 with 4 rules applied. Total rules applied 1073 place count 114 transition count 212
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1074 place count 113 transition count 211
Iterating global reduction 4 with 1 rules applied. Total rules applied 1075 place count 113 transition count 211
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1076 place count 112 transition count 210
Iterating global reduction 4 with 1 rules applied. Total rules applied 1077 place count 112 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1078 place count 112 transition count 209
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1118 place count 92 transition count 187
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1136 place count 74 transition count 134
Iterating global reduction 5 with 18 rules applied. Total rules applied 1154 place count 74 transition count 134
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1161 place count 74 transition count 127
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1171 place count 64 transition count 114
Iterating global reduction 6 with 10 rules applied. Total rules applied 1181 place count 64 transition count 114
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1191 place count 54 transition count 101
Iterating global reduction 6 with 10 rules applied. Total rules applied 1201 place count 54 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1205 place count 54 transition count 97
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1219 place count 47 transition count 106
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1220 place count 46 transition count 100
Iterating global reduction 7 with 1 rules applied. Total rules applied 1221 place count 46 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1222 place count 46 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1225 place count 46 transition count 96
Applied a total of 1225 rules in 63 ms. Remains 46 /691 variables (removed 645) and now considering 96/801 (removed 705) transitions.
[2026-05-25 10:29:07] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5056569011913831072.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8578402787170622855.kers'
[2026-05-25 10:29:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5056569011913831072.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8578402787170622855.kers]
Normalized transition count is 91 out of 92 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 91 rows 45 cols 298 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-25 10:29:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8578402787170622855.kers
Total runtime 0 ms.
[2026-05-25 10:29:07] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 10:29:07] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2026-05-25 10:29:07] [INFO ] Invariant cache hit.
[2026-05-25 10:29:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 10:29:07] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2026-05-25 10:29:07] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2026-05-25 10:29:07] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2026-05-25 10:29:07] [INFO ] Invariant cache hit.
[2026-05-25 10:29:07] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 91/137 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/138 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 72 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4565 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 91/137 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 87/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 1/138 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/138 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 160 constraints, problems are : Problem set: 0 solved, 87 unsolved in 7594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12190ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 12190ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/691 places, 96/801 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12451 ms. Remains : 46/691 places, 96/801 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G((p1&&F(p2))))))'
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-06
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-06 finished in 12607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&(G(p2) U X(X(G(!p0))))))'
Support contains 3 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 677 transition count 787
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 677 transition count 787
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 40 place count 665 transition count 775
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 665 transition count 775
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 655 transition count 765
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 655 transition count 765
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 655 transition count 764
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 81 place count 647 transition count 756
Iterating global reduction 1 with 8 rules applied. Total rules applied 89 place count 647 transition count 756
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 97 place count 639 transition count 748
Iterating global reduction 1 with 8 rules applied. Total rules applied 105 place count 639 transition count 748
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 113 place count 631 transition count 740
Iterating global reduction 1 with 8 rules applied. Total rules applied 121 place count 631 transition count 740
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 128 place count 624 transition count 733
Iterating global reduction 1 with 7 rules applied. Total rules applied 135 place count 624 transition count 733
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 142 place count 617 transition count 726
Iterating global reduction 1 with 7 rules applied. Total rules applied 149 place count 617 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 150 place count 617 transition count 725
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 155 place count 612 transition count 720
Iterating global reduction 2 with 5 rules applied. Total rules applied 160 place count 612 transition count 720
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 165 place count 607 transition count 715
Iterating global reduction 2 with 5 rules applied. Total rules applied 170 place count 607 transition count 715
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 603 transition count 711
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 603 transition count 711
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 181 place count 600 transition count 708
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 600 transition count 708
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 186 place count 598 transition count 706
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 598 transition count 706
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 190 place count 596 transition count 704
Iterating global reduction 2 with 2 rules applied. Total rules applied 192 place count 596 transition count 704
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 194 place count 594 transition count 702
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 594 transition count 702
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 198 place count 594 transition count 700
Applied a total of 198 rules in 214 ms. Remains 594 /691 variables (removed 97) and now considering 700/801 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3260775155116494047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16263418498773661863.kers'
[2026-05-25 10:29:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3260775155116494047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16263418498773661863.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 700 rows 594 cols 1735 entries
Finished phase 1 with 590 SingleSign rule and 0 generalized
[2026-05-25 10:29:20] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16263418498773661863.kers
Total runtime 3 ms.
[2026-05-25 10:29:20] [INFO ] Implicit Places using invariants in 262 ms returned []
[2026-05-25 10:29:20] [INFO ] Invariant cache hit.
[2026-05-25 10:29:20] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Running 699 sub problems to find dead transitions.
[2026-05-25 10:29:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/594 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1294 variables, and 4 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/594 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/594 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1294 variables, and 7 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/594 constraints, PredecessorRefiner: 0/699 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 699 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 594/691 places, 700/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61114 ms. Remains : 594/691 places, 700/801 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&(G(p2) U X(X(G(!p0))))))'
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p1) p0), (NOT p1), p0, (NOT p1), true, p0, (AND p0 (NOT p2)), p0, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-07 finished in 61584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(F((p0 U (p1||G(p0))))))&&F((p2 U (p3||G(p2)))))||G(F((p0 U (p1||G(p0)))))))'
Support contains 6 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 678 transition count 788
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 678 transition count 788
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 668 transition count 778
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 668 transition count 778
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 660 transition count 770
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 660 transition count 770
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 660 transition count 769
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 654 transition count 763
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 654 transition count 763
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 648 transition count 757
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 648 transition count 757
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 93 place count 642 transition count 751
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 642 transition count 751
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 637 transition count 746
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 637 transition count 746
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 114 place count 632 transition count 741
Iterating global reduction 1 with 5 rules applied. Total rules applied 119 place count 632 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 632 transition count 740
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 124 place count 628 transition count 736
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 628 transition count 736
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 132 place count 624 transition count 732
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 624 transition count 732
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 621 transition count 729
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 621 transition count 729
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 618 transition count 726
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 618 transition count 726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 616 transition count 724
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 616 transition count 724
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 614 transition count 722
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 614 transition count 722
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 612 transition count 720
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 612 transition count 720
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 612 transition count 718
Applied a total of 162 rules in 194 ms. Remains 612 /691 variables (removed 79) and now considering 718/801 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3248002625754885118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15976135819125425550.kers'
[2026-05-25 10:30:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3248002625754885118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15976135819125425550.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 718 rows 612 cols 1773 entries
Finished phase 1 with 608 SingleSign rule and 0 generalized
[2026-05-25 10:30:21] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-15976135819125425550.kers
Total runtime 16 ms.
[2026-05-25 10:30:21] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-05-25 10:30:21] [INFO ] Invariant cache hit.
[2026-05-25 10:30:22] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 717 sub problems to find dead transitions.
[2026-05-25 10:30:22] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 717 unsolved
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 0 solved, 717 unsolved
Search for dead transitions found 0 dead transitions in 30119ms
Starting structural reductions in LTL mode, iteration 1 : 612/691 places, 718/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31045 ms. Remains : 612/691 places, 718/801 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0 U (p1||G(p0)))))||(X(X(F((p0 U (p1||G(p0))))))&&F((p2 U (p3||G(p2)))))))'
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-08
Product exploration explored 100000 steps with 3501 reset in 153 ms.
Product exploration explored 100000 steps with 3549 reset in 161 ms.
Computed a total of 131 stabilizing places and 137 stable transitions
Computed a total of 131 stabilizing places and 137 stable transitions
Knowledge based reduction with 18 factoid took 95 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 11 states, 32 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (658 resets) in 431 ms. (92 steps per ms) remains 10/17 properties
BEST_FIRST walk for 40003 steps (151 resets) in 419 ms. (95 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (173 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (166 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (146 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (164 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (171 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (169 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (165 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (170 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (154 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
[2026-05-25 10:30:53] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf11 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem apf6 is UNSAT
Problem apf12 is UNSAT
Problem apf14 is UNSAT
At refinement iteration 1 (OVERLAPS) 414/420 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/612 variables, 1/4 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 718/1330 variables, 612/616 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1330 variables, 0/616 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1330 variables, 0/616 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 616 constraints, problems are : Problem set: 8 solved, 2 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 612/612 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 414/420 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 192/612 variables, 1/5 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 718/1330 variables, 612/617 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1330 variables, 2/619 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1330 variables, 1/620 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1330 variables, 0/620 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1330 variables, 0/620 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1330/1330 variables, and 620 constraints, problems are : Problem set: 8 solved, 2 unsolved in 2157 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 612/612 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3169ms problems are : Problem set: 8 solved, 2 unsolved
Finished Parikh walk after 1445 steps, including 18 resets, run visited all 2 properties in 8 ms. (steps per millisecond=180 )
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 9 ms.
Found 8 invariant AP formulas.
Knowledge based reduction with 26 factoid took 202 ms. Reduced automaton from 11 states, 32 edges and 4 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), false, false, false]
Knowledge-based reduction took 4423 ms.
Stuttering acceptance computed with spot in 380 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), false, false, false]
Support contains 6 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 718/718 transitions.
Graph (trivial) has 590 edges and 612 vertex of which 48 / 612 are part of one of the 9 SCC in 2 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 411 transitions
Trivial Post-agglo rules discarded 411 transitions
Performed 411 trivial Post agglomeration. Transition count delta: 411
Iterating post reduction 0 with 411 rules applied. Total rules applied 412 place count 572 transition count 261
Reduce places removed 411 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 421 rules applied. Total rules applied 833 place count 161 transition count 251
Reduce places removed 4 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 14 rules applied. Total rules applied 847 place count 157 transition count 241
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 857 place count 147 transition count 241
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 857 place count 147 transition count 210
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 919 place count 116 transition count 210
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 921 place count 114 transition count 208
Iterating global reduction 4 with 2 rules applied. Total rules applied 923 place count 114 transition count 208
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 967 place count 92 transition count 186
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 984 place count 75 transition count 134
Iterating global reduction 4 with 17 rules applied. Total rules applied 1001 place count 75 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1009 place count 75 transition count 126
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1017 place count 67 transition count 115
Iterating global reduction 5 with 8 rules applied. Total rules applied 1025 place count 67 transition count 115
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1032 place count 60 transition count 105
Iterating global reduction 5 with 7 rules applied. Total rules applied 1039 place count 60 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1040 place count 60 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1052 place count 54 transition count 112
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1053 place count 53 transition count 106
Iterating global reduction 6 with 1 rules applied. Total rules applied 1054 place count 53 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1055 place count 53 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1058 place count 53 transition count 102
Applied a total of 1058 rules in 42 ms. Remains 53 /612 variables (removed 559) and now considering 102/718 (removed 616) transitions.
[2026-05-25 10:30:58] [INFO ] Flow matrix only has 99 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7993188707547071353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10265500933258979069.kers'
[2026-05-25 10:30:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7993188707547071353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10265500933258979069.kers]
Normalized transition count is 98 out of 99 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 53 cols 358 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-25 10:30:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10265500933258979069.kers
Total runtime 1 ms.
[2026-05-25 10:30:58] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 10:30:58] [INFO ] Flow matrix only has 99 transitions (discarded 3 similar events)
[2026-05-25 10:30:58] [INFO ] Invariant cache hit.
[2026-05-25 10:30:58] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 10:30:58] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2026-05-25 10:30:58] [INFO ] Redundant transitions in 3 ms returned []
Running 95 sub problems to find dead transitions.
[2026-05-25 10:30:58] [INFO ] Flow matrix only has 99 transitions (discarded 3 similar events)
[2026-05-25 10:30:58] [INFO ] Invariant cache hit.
[2026-05-25 10:30:58] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 2/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 98/151 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 79 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 2/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 98/151 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 95/173 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 174 constraints, problems are : Problem set: 0 solved, 95 unsolved in 9153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14427ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 14428ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/612 places, 102/718 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14671 ms. Remains : 53/612 places, 102/718 transitions.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Knowledge based reduction with 16 factoid took 203 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (3664 resets) in 239 ms. (166 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (758 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (878 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
[2026-05-25 10:31:13] [INFO ] Flow matrix only has 99 transitions (discarded 3 similar events)
[2026-05-25 10:31:13] [INFO ] Invariant cache hit.
[2026-05-25 10:31:13] [INFO ] State equation strengthened by 13 read => feed constraints.
Problem apf7 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 151/152 variables, and 57 constraints, problems are : Problem set: 2 solved, 0 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 18 factoid took 276 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 434 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), false, false, false]
Knowledge-based reduction took 1190 ms.
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), false, false, false]
Stuttering acceptance computed with spot in 428 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), false, false, false]
Stuttering criterion allowed to conclude after 9972 steps with 1177 reset in 13 ms.
FORMULA MedleyB-PT-B01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-08 finished in 53302 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 U (G(p0)||(p0&&G((p1&&X(G(p2)))))))))'
Support contains 3 out of 691 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Graph (trivial) has 679 edges and 691 vertex of which 49 / 691 are part of one of the 9 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 483 rules applied. Total rules applied 484 place count 650 transition count 272
Reduce places removed 483 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 493 rules applied. Total rules applied 977 place count 167 transition count 262
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 982 place count 163 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 983 place count 162 transition count 261
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 983 place count 162 transition count 227
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 1051 place count 128 transition count 227
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1059 place count 120 transition count 219
Iterating global reduction 4 with 8 rules applied. Total rules applied 1067 place count 120 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1067 place count 120 transition count 218
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1069 place count 119 transition count 218
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1072 place count 116 transition count 215
Iterating global reduction 4 with 3 rules applied. Total rules applied 1075 place count 116 transition count 215
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1076 place count 115 transition count 214
Iterating global reduction 4 with 1 rules applied. Total rules applied 1077 place count 115 transition count 214
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1078 place count 114 transition count 213
Iterating global reduction 4 with 1 rules applied. Total rules applied 1079 place count 114 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1080 place count 114 transition count 212
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1122 place count 93 transition count 189
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1139 place count 76 transition count 139
Iterating global reduction 5 with 17 rules applied. Total rules applied 1156 place count 76 transition count 139
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1165 place count 76 transition count 130
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1172 place count 69 transition count 122
Iterating global reduction 6 with 7 rules applied. Total rules applied 1179 place count 69 transition count 122
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1186 place count 62 transition count 114
Iterating global reduction 6 with 7 rules applied. Total rules applied 1193 place count 62 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1196 place count 62 transition count 111
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1214 place count 53 transition count 123
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1215 place count 52 transition count 113
Iterating global reduction 7 with 1 rules applied. Total rules applied 1216 place count 52 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1217 place count 52 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1221 place count 52 transition count 108
Applied a total of 1221 rules in 24 ms. Remains 52 /691 variables (removed 639) and now considering 108/801 (removed 693) transitions.
[2026-05-25 10:31:14] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9812182744451641029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17146218478624409450.kers'
[2026-05-25 10:31:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9812182744451641029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17146218478624409450.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 101 rows 51 cols 329 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-25 10:31:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17146218478624409450.kers
Total runtime 0 ms.
[2026-05-25 10:31:14] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 10:31:14] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
[2026-05-25 10:31:14] [INFO ] Invariant cache hit.
[2026-05-25 10:31:14] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-25 10:31:15] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2026-05-25 10:31:15] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2026-05-25 10:31:15] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
[2026-05-25 10:31:15] [INFO ] Invariant cache hit.
[2026-05-25 10:31:15] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 101/153 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 1/154 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 83 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6401 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 10/10 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/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 101/153 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 99/181 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/154 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/154 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 182 constraints, problems are : Problem set: 0 solved, 99 unsolved in 9337 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15779ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 15780ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/691 places, 108/801 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15953 ms. Remains : 52/691 places, 108/801 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 U (G(p0)||(G((p1&&X(G(p2))))&&p0)))))'
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p0) p2) (AND p1 (NOT p0) (NOT p2)))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-09
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-09 finished in 16125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)||F(p2)||X(F(p3))) U X(X(p4))))'
Support contains 7 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 678 transition count 788
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 678 transition count 788
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 668 transition count 778
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 668 transition count 778
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 660 transition count 770
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 660 transition count 770
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 653 transition count 763
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 653 transition count 763
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 646 transition count 756
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 646 transition count 756
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 639 transition count 749
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 639 transition count 749
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 633 transition count 743
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 633 transition count 743
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 122 place count 627 transition count 737
Iterating global reduction 0 with 6 rules applied. Total rules applied 128 place count 627 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 129 place count 627 transition count 736
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 133 place count 623 transition count 732
Iterating global reduction 1 with 4 rules applied. Total rules applied 137 place count 623 transition count 732
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 141 place count 619 transition count 728
Iterating global reduction 1 with 4 rules applied. Total rules applied 145 place count 619 transition count 728
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 616 transition count 725
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 616 transition count 725
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 153 place count 614 transition count 723
Iterating global reduction 1 with 2 rules applied. Total rules applied 155 place count 614 transition count 723
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 156 place count 613 transition count 722
Iterating global reduction 1 with 1 rules applied. Total rules applied 157 place count 613 transition count 722
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 158 place count 612 transition count 721
Iterating global reduction 1 with 1 rules applied. Total rules applied 159 place count 612 transition count 721
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 160 place count 611 transition count 720
Iterating global reduction 1 with 1 rules applied. Total rules applied 161 place count 611 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 162 place count 611 transition count 719
Applied a total of 162 rules in 191 ms. Remains 611 /691 variables (removed 80) and now considering 719/801 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18081057084079091172.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6574180872299326145.kers'
[2026-05-25 10:31:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18081057084079091172.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6574180872299326145.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 719 rows 611 cols 1779 entries
Finished phase 1 with 607 SingleSign rule and 0 generalized
[2026-05-25 10:31:31] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6574180872299326145.kers
Total runtime 4 ms.
[2026-05-25 10:31:31] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-25 10:31:31] [INFO ] Invariant cache hit.
[2026-05-25 10:31:32] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
Running 718 sub problems to find dead transitions.
[2026-05-25 10:31:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (OVERLAPS) 1/611 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/1330 variables, and 4 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/611 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (OVERLAPS) 1/611 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 611/1330 variables, and 7 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/611 constraints, PredecessorRefiner: 0/718 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 611/691 places, 719/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61266 ms. Remains : 611/691 places, 719/801 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)||F(p2)||X(F(p3))) U X(X(p4))))'
Stuttering acceptance computed with spot in 591 ms :[(NOT p4), (AND (NOT p2) (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p2) (NOT p3) (NOT p4) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p2) (NOT p3) (NOT p4) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p4)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-12
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-12 finished in 61938 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 691 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Graph (trivial) has 683 edges and 691 vertex of which 52 / 691 are part of one of the 9 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 0 with 484 rules applied. Total rules applied 485 place count 647 transition count 267
Reduce places removed 484 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 494 rules applied. Total rules applied 979 place count 163 transition count 257
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 983 place count 159 transition count 257
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 983 place count 159 transition count 222
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 1053 place count 124 transition count 222
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1062 place count 115 transition count 213
Iterating global reduction 3 with 9 rules applied. Total rules applied 1071 place count 115 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1071 place count 115 transition count 212
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1073 place count 114 transition count 212
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1077 place count 110 transition count 208
Iterating global reduction 3 with 4 rules applied. Total rules applied 1081 place count 110 transition count 208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1082 place count 109 transition count 207
Iterating global reduction 3 with 1 rules applied. Total rules applied 1083 place count 109 transition count 207
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1084 place count 108 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 1085 place count 108 transition count 206
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1125 place count 88 transition count 184
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1144 place count 69 transition count 130
Iterating global reduction 3 with 19 rules applied. Total rules applied 1163 place count 69 transition count 130
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1172 place count 69 transition count 121
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1182 place count 59 transition count 108
Iterating global reduction 4 with 10 rules applied. Total rules applied 1192 place count 59 transition count 108
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1202 place count 49 transition count 95
Iterating global reduction 4 with 10 rules applied. Total rules applied 1212 place count 49 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1216 place count 49 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1230 place count 42 transition count 100
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1231 place count 41 transition count 94
Iterating global reduction 5 with 1 rules applied. Total rules applied 1232 place count 41 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1233 place count 41 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1236 place count 41 transition count 90
Applied a total of 1236 rules in 50 ms. Remains 41 /691 variables (removed 650) and now considering 90/801 (removed 711) transitions.
[2026-05-25 10:32:32] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2458298680793363122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1964953394266794502.kers'
[2026-05-25 10:32:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2458298680793363122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1964953394266794502.kers]
Normalized transition count is 85 out of 86 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 85 rows 40 cols 286 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-25 10:32:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1964953394266794502.kers
Total runtime 0 ms.
[2026-05-25 10:32:33] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 10:32:33] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2026-05-25 10:32:33] [INFO ] Invariant cache hit.
[2026-05-25 10:32:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 10:32:33] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2026-05-25 10:32:33] [INFO ] Redundant transitions in 0 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-25 10:32:33] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2026-05-25 10:32:33] [INFO ] Invariant cache hit.
[2026-05-25 10:32:33] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 85/126 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 67 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5001 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 85/126 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 81/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (OVERLAPS) 0/127 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 149 constraints, problems are : Problem set: 0 solved, 81 unsolved in 7561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12574ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 12574ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/691 places, 90/801 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12852 ms. Remains : 41/691 places, 90/801 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 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-13
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-13 finished in 13018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0))) U (p1 U p0))))'
Support contains 3 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 801/801 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 677 transition count 787
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 677 transition count 787
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 666 transition count 776
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 666 transition count 776
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 657 transition count 767
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 657 transition count 767
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 657 transition count 766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 650 transition count 759
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 650 transition count 759
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 643 transition count 752
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 643 transition count 752
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 636 transition count 745
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 636 transition count 745
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 630 transition count 739
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 630 transition count 739
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 129 place count 624 transition count 733
Iterating global reduction 1 with 6 rules applied. Total rules applied 135 place count 624 transition count 733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 136 place count 624 transition count 732
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 621 transition count 729
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 621 transition count 729
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 618 transition count 726
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 618 transition count 726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 616 transition count 724
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 616 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 615 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 615 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 614 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 614 transition count 722
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 613 transition count 721
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 613 transition count 721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 612 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 612 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 612 transition count 719
Applied a total of 161 rules in 239 ms. Remains 612 /691 variables (removed 79) and now considering 719/801 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10289201819728180578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8335149685914219354.kers'
[2026-05-25 10:32:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10289201819728180578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8335149685914219354.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 719 rows 612 cols 1777 entries
Finished phase 1 with 608 SingleSign rule and 0 generalized
[2026-05-25 10:32:46] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8335149685914219354.kers
Total runtime 11 ms.
[2026-05-25 10:32:46] [INFO ] Implicit Places using invariants in 298 ms returned []
[2026-05-25 10:32:46] [INFO ] Invariant cache hit.
[2026-05-25 10:32:46] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 718 sub problems to find dead transitions.
[2026-05-25 10:32:46] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
SMT process timed out in 30094ms, After SMT, problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 30096ms
Starting structural reductions in LTL mode, iteration 1 : 612/691 places, 719/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31157 ms. Remains : 612/691 places, 719/801 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0))) U (p1 U p0))))'
Stuttering acceptance computed with spot in 550 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-15
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-15 finished in 31777 ms.
All properties solved by simple procedures.
Total runtime 594924 ms.

BK_STOP 1779705197744

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MedleyB-PT-B01"
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 MedleyB-PT-B01, 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 r178-oct2-177969020000284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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