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.r002-oct2-177944366100300.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 ASLink-PT-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366100300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 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 279K 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 ASLink-PT-02a-LTLFireability-00
FORMULA_NAME ASLink-PT-02a-LTLFireability-01
FORMULA_NAME ASLink-PT-02a-LTLFireability-02
FORMULA_NAME ASLink-PT-02a-LTLFireability-03
FORMULA_NAME ASLink-PT-02a-LTLFireability-04
FORMULA_NAME ASLink-PT-02a-LTLFireability-05
FORMULA_NAME ASLink-PT-02a-LTLFireability-06
FORMULA_NAME ASLink-PT-02a-LTLFireability-07
FORMULA_NAME ASLink-PT-02a-LTLFireability-08
FORMULA_NAME ASLink-PT-02a-LTLFireability-09
FORMULA_NAME ASLink-PT-02a-LTLFireability-10
FORMULA_NAME ASLink-PT-02a-LTLFireability-11
FORMULA_NAME ASLink-PT-02a-LTLFireability-12
FORMULA_NAME ASLink-PT-02a-LTLFireability-13
FORMULA_NAME ASLink-PT-02a-LTLFireability-14
FORMULA_NAME ASLink-PT-02a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779470942979

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 17:29:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 17:29:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:29:04] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2026-05-22 17:29:04] [INFO ] Transformed 626 places.
[2026-05-22 17:29:04] [INFO ] Transformed 1008 transitions.
[2026-05-22 17:29:04] [INFO ] Found NUPN structural information;
[2026-05-22 17:29:04] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 241 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 4 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 616 transition count 998
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 613 transition count 990
Ensure Unique test removed 1 places
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 612 transition count 990
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 612 transition count 989
Applied a total of 18 rules in 128 ms. Remains 612 /626 variables (removed 14) and now considering 989/998 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16460785208348479429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1846876774576535041.kers'
[2026-05-22 17:29:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16460785208348479429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1846876774576535041.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 989 rows 611 cols 3742 entries
Finished phase 1 with 224 SingleSign rule and 281 generalized
[2026-05-22 17:29:04] [INFO ] Computed 107 invariants in 9 ms
Computed 107 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-1846876774576535041.kers
Total runtime 10 ms.
[2026-05-22 17:29:05] [INFO ] Implicit Places using invariants in 725 ms returned [19, 20, 23, 33, 51, 69, 199, 216, 221, 222, 242, 260, 389, 406, 411, 412, 413, 448, 450, 471, 472, 473, 474, 492, 500, 508, 514, 520, 526, 532, 540, 546, 552, 560]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 772 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 578/626 places, 989/998 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 566 transition count 977
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 566 transition count 977
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 558 transition count 969
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 558 transition count 969
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 553 transition count 964
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 553 transition count 964
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 551 transition count 962
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 551 transition count 962
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 549 transition count 960
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 549 transition count 960
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 548 transition count 959
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 548 transition count 959
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 547 transition count 958
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 547 transition count 958
Applied a total of 62 rules in 134 ms. Remains 547 /578 variables (removed 31) and now considering 958/989 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11035311890800328089.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12181766180193029379.kers'
[2026-05-22 17:29:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11035311890800328089.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12181766180193029379.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 958 rows 546 cols 3427 entries
Finished phase 1 with 327 SingleSign rule and 147 generalized
[2026-05-22 17:29:05] [INFO ] Computed 73 invariants in 4 ms
Computed 73 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12181766180193029379.kers
Total runtime 5 ms.
[2026-05-22 17:29:06] [INFO ] Implicit Places using invariants in 700 ms returned []
[2026-05-22 17:29:06] [INFO ] Invariant cache hit.
[2026-05-22 17:29:07] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 547/626 places, 958/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2800 ms. Remains : 547/626 places, 958/998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 958/958 transitions.
Applied a total of 0 rules in 42 ms. Remains 547 /547 variables (removed 0) and now considering 958/958 (removed 0) transitions.
[2026-05-22 17:29:07] [INFO ] Invariant cache hit.
[2026-05-22 17:29:08] [INFO ] Implicit Places using invariants in 712 ms returned []
[2026-05-22 17:29:08] [INFO ] Invariant cache hit.
[2026-05-22 17:29:09] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
Running 957 sub problems to find dead transitions.
[2026-05-22 17:29:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 957 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1505 variables, and 52 constraints, problems are : Problem set: 0 solved, 957 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 52/59 constraints, State Equation: 0/547 constraints, PredecessorRefiner: 957/957 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 957 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 957 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 957 unsolved
At refinement iteration 2 (OVERLAPS) 1/547 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 957 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 957 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/1505 variables, and 75 constraints, problems are : Problem set: 0 solved, 957 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 0/547 constraints, PredecessorRefiner: 0/957 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60543ms problems are : Problem set: 0 solved, 957 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in LTL mode , in 1 iterations and 62356 ms. Remains : 547/547 places, 958/958 transitions.
Support contains 60 out of 547 places after structural reductions.
[2026-05-22 17:30:10] [INFO ] Flatten gal took : 104 ms
[2026-05-22 17:30:10] [INFO ] Flatten gal took : 49 ms
[2026-05-22 17:30:10] [INFO ] Input system was already deterministic with 958 transitions.
Support contains 59 out of 547 places (down from 60) after GAL structural reductions.
RANDOM walk for 40000 steps (468 resets) in 3387 ms. (11 steps per ms) remains 23/33 properties
BEST_FIRST walk for 4003 steps (14 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 73 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (14 resets) in 77 ms. (51 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (11 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (12 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (13 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
[2026-05-22 17:30:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 2 (OVERLAPS) 121/162 variables, 9/10 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 63/225 variables, 5/15 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 322/547 variables, 58/73 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 3/76 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 958/1505 variables, 547/623 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1505 variables, 0/623 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/1505 variables, 0/623 constraints. Problems are: Problem set: 3 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1505/1505 variables, and 623 constraints, problems are : Problem set: 3 solved, 20 unsolved in 3862 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 122/159 variables, 9/10 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 63/222 variables, 5/15 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 325/547 variables, 58/73 constraints. Problems are: Problem set: 3 solved, 20 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 3/76 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/76 constraints. Problems are: Problem set: 4 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 9 (OVERLAPS) 958/1505 variables, 547/623 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1505 variables, 4/627 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1505 variables, 1/628 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1505 variables, 0/628 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1505 variables, 0/628 constraints. Problems are: Problem set: 19 solved, 4 unsolved
No progress, stopping.
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 1505/1505 variables, and 628 constraints, problems are : Problem set: 19 solved, 4 unsolved in 4066 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 4/23 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7963ms problems are : Problem set: 19 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2096 ms.
Support contains 10 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 958/958 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 547 transition count 880
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 469 transition count 880
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 156 place count 469 transition count 815
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 306 place count 384 transition count 815
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 307 place count 384 transition count 814
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 308 place count 383 transition count 814
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 308 place count 383 transition count 806
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 324 place count 375 transition count 806
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 330 place count 369 transition count 787
Iterating global reduction 4 with 6 rules applied. Total rules applied 336 place count 369 transition count 787
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 4 with 21 rules applied. Total rules applied 357 place count 363 transition count 772
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 371 place count 349 transition count 772
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 371 place count 349 transition count 771
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 373 place count 348 transition count 771
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 378 place count 343 transition count 759
Iterating global reduction 6 with 5 rules applied. Total rules applied 383 place count 343 transition count 759
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 386 place count 343 transition count 756
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 387 place count 342 transition count 748
Iterating global reduction 7 with 1 rules applied. Total rules applied 388 place count 342 transition count 748
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 389 place count 341 transition count 740
Iterating global reduction 7 with 1 rules applied. Total rules applied 390 place count 341 transition count 740
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 391 place count 340 transition count 732
Iterating global reduction 7 with 1 rules applied. Total rules applied 392 place count 340 transition count 732
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 393 place count 339 transition count 724
Iterating global reduction 7 with 1 rules applied. Total rules applied 394 place count 339 transition count 724
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 395 place count 338 transition count 716
Iterating global reduction 7 with 1 rules applied. Total rules applied 396 place count 338 transition count 716
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 397 place count 337 transition count 708
Iterating global reduction 7 with 1 rules applied. Total rules applied 398 place count 337 transition count 708
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 399 place count 336 transition count 700
Iterating global reduction 7 with 1 rules applied. Total rules applied 400 place count 336 transition count 700
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 401 place count 335 transition count 692
Iterating global reduction 7 with 1 rules applied. Total rules applied 402 place count 335 transition count 692
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 403 place count 334 transition count 684
Iterating global reduction 7 with 1 rules applied. Total rules applied 404 place count 334 transition count 684
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 405 place count 333 transition count 676
Iterating global reduction 7 with 1 rules applied. Total rules applied 406 place count 333 transition count 676
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 407 place count 332 transition count 668
Iterating global reduction 7 with 1 rules applied. Total rules applied 408 place count 332 transition count 668
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 409 place count 331 transition count 660
Iterating global reduction 7 with 1 rules applied. Total rules applied 410 place count 331 transition count 660
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 411 place count 330 transition count 652
Iterating global reduction 7 with 1 rules applied. Total rules applied 412 place count 330 transition count 652
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 413 place count 329 transition count 644
Iterating global reduction 7 with 1 rules applied. Total rules applied 414 place count 329 transition count 644
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 415 place count 328 transition count 636
Iterating global reduction 7 with 1 rules applied. Total rules applied 416 place count 328 transition count 636
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 61 rules applied. Total rules applied 477 place count 297 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 479 place count 295 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 481 place count 295 transition count 604
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 482 place count 295 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 483 place count 294 transition count 603
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 484 place count 294 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 485 place count 293 transition count 602
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 492 place count 293 transition count 595
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 500 place count 285 transition count 595
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 509 place count 285 transition count 595
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 511 place count 285 transition count 595
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 512 place count 284 transition count 594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 514 place count 282 transition count 594
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 4 Pre rules applied. Total rules applied 514 place count 282 transition count 590
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 524 place count 276 transition count 590
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 526 place count 274 transition count 588
Iterating global reduction 12 with 2 rules applied. Total rules applied 528 place count 274 transition count 588
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 530 place count 274 transition count 586
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 532 place count 273 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 533 place count 273 transition count 584
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 534 place count 273 transition count 583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 535 place count 272 transition count 583
Applied a total of 535 rules in 325 ms. Remains 272 /547 variables (removed 275) and now considering 583/958 (removed 375) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 272/547 places, 583/958 transitions.
RANDOM walk for 40000 steps (828 resets) in 275 ms. (144 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (344 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15913796796892150315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17162978737021475293.kers'
[2026-05-22 17:30:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15913796796892150315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17162978737021475293.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 583 rows 271 cols 2374 entries
Finished phase 1 with 85 SingleSign rule and 146 generalized
[2026-05-22 17:30:22] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17162978737021475293.kers
Total runtime 5 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/35 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/66 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/104 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 61/165 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/182 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 25/207 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 50/257 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/263 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/263 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/272 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/272 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 583/855 variables, 272/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/855 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/855 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 272/272 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/35 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/66 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/104 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 61/165 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/182 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 25/207 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 50/257 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/263 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/263 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/272 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/272 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 583/855 variables, 272/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/855 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/855 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/855 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 781ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 583/583 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 270 transition count 582
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 270 transition count 580
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 268 transition count 580
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 267 transition count 580
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 266 transition count 579
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 266 transition count 578
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13 place count 265 transition count 577
Applied a total of 13 rules in 35 ms. Remains 265 /272 variables (removed 7) and now considering 577/583 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 265/272 places, 577/583 transitions.
RANDOM walk for 40000 steps (820 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (320 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6912 steps, run visited all 1 properties in 63 ms. (steps per millisecond=109 )
Probabilistic random walk after 6912 steps, saw 4821 distinct states, run finished after 67 ms. (steps per millisecond=103 ) properties seen :1
Successfully simplified 20 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-02a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-02a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0&&F(G(p1)))))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 958/958 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 545 transition count 958
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 540 transition count 940
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 540 transition count 940
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 538 transition count 931
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 538 transition count 931
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 536 transition count 922
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 536 transition count 922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 535 transition count 914
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 535 transition count 914
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 534 transition count 906
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 534 transition count 906
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 533 transition count 898
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 533 transition count 898
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 532 transition count 890
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 532 transition count 890
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 531 transition count 882
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 531 transition count 882
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 530 transition count 874
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 530 transition count 874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 529 transition count 866
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 529 transition count 866
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 528 transition count 858
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 528 transition count 858
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 527 transition count 850
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 527 transition count 850
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 526 transition count 842
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 526 transition count 842
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 525 transition count 834
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 525 transition count 834
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 524 transition count 826
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 524 transition count 826
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 523 transition count 818
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 523 transition count 818
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 522 transition count 810
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 522 transition count 810
Applied a total of 48 rules in 242 ms. Remains 522 /547 variables (removed 25) and now considering 810/958 (removed 148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16308759621412550259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13067181084352239410.kers'
[2026-05-22 17:30:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16308759621412550259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13067181084352239410.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 810 rows 522 cols 2847 entries
Finished phase 1 with 321 SingleSign rule and 130 generalized
[2026-05-22 17:30:23] [INFO ] Computed 71 invariants in 4 ms
Computed 71 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-13067181084352239410.kers
Total runtime 18 ms.
[2026-05-22 17:30:24] [INFO ] Implicit Places using invariants in 468 ms returned [1, 211, 378, 414]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 470 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 518/547 places, 810/958 transitions.
Applied a total of 0 rules in 15 ms. Remains 518 /518 variables (removed 0) and now considering 810/810 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 728 ms. Remains : 518/547 places, 810/958 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((F(G(p0))&&p1)))))'
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-03
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-02a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-03 finished in 1185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&F(p1)))'
Support contains 6 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 958/958 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 546 transition count 958
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 540 transition count 939
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 540 transition count 939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 540 transition count 938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 538 transition count 929
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 538 transition count 929
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 536 transition count 920
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 536 transition count 920
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 535 transition count 912
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 535 transition count 912
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 534 transition count 904
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 534 transition count 904
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 533 transition count 896
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 533 transition count 896
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 532 transition count 888
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 532 transition count 888
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 531 transition count 880
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 531 transition count 880
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 530 transition count 872
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 530 transition count 872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 529 transition count 864
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 529 transition count 864
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 528 transition count 856
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 528 transition count 856
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 527 transition count 848
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 527 transition count 848
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 526 transition count 840
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 526 transition count 840
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 525 transition count 832
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 525 transition count 832
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 524 transition count 824
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 524 transition count 824
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 523 transition count 816
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 523 transition count 816
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 522 transition count 808
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 522 transition count 808
Applied a total of 50 rules in 198 ms. Remains 522 /547 variables (removed 25) and now considering 808/958 (removed 150) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1243482804994103577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2224677473811192488.kers'
[2026-05-22 17:30:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1243482804994103577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2224677473811192488.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 808 rows 522 cols 2843 entries
Finished phase 1 with 313 SingleSign rule and 137 generalized
[2026-05-22 17:30:24] [INFO ] Computed 72 invariants in 4 ms
Computed 72 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2224677473811192488.kers
Total runtime 5 ms.
[2026-05-22 17:30:25] [INFO ] Implicit Places using invariants in 495 ms returned [1, 212, 415]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 500 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 519/547 places, 808/958 transitions.
Applied a total of 0 rules in 10 ms. Remains 519 /519 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 708 ms. Remains : 519/547 places, 808/958 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&F(p1)))'
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-11
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-11 finished in 972 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(F(p1))&&p0))))'
Support contains 6 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 958/958 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 546 transition count 958
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 540 transition count 939
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 540 transition count 939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 540 transition count 938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 538 transition count 929
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 538 transition count 929
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 536 transition count 920
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 536 transition count 920
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 535 transition count 912
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 535 transition count 912
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 534 transition count 904
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 534 transition count 904
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 533 transition count 896
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 533 transition count 896
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 532 transition count 888
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 532 transition count 888
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 531 transition count 880
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 531 transition count 880
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 530 transition count 872
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 530 transition count 872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 529 transition count 864
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 529 transition count 864
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 528 transition count 856
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 528 transition count 856
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 527 transition count 848
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 527 transition count 848
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 526 transition count 840
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 526 transition count 840
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 525 transition count 832
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 525 transition count 832
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 524 transition count 824
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 524 transition count 824
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 523 transition count 816
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 523 transition count 816
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 522 transition count 808
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 522 transition count 808
Applied a total of 50 rules in 159 ms. Remains 522 /547 variables (removed 25) and now considering 808/958 (removed 150) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9308011993388156612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2737204728198233948.kers'
[2026-05-22 17:30:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9308011993388156612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2737204728198233948.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 808 rows 521 cols 2841 entries
Finished phase 1 with 320 SingleSign rule and 130 generalized
[2026-05-22 17:30:25] [INFO ] Computed 72 invariants in 4 ms
Computed 72 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2737204728198233948.kers
Total runtime 5 ms.
[2026-05-22 17:30:26] [INFO ] Implicit Places using invariants in 438 ms returned [212, 379, 415]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 441 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 519/547 places, 808/958 transitions.
Applied a total of 0 rules in 22 ms. Remains 519 /519 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 622 ms. Remains : 519/547 places, 808/958 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(F(p1))&&p0))))'
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-12 finished in 926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(((F(X(p0))&&F(p0)) U p1)))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 958/958 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 544 transition count 873
Reduce places removed 86 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 172 place count 458 transition count 872
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 173 place count 457 transition count 872
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 173 place count 457 transition count 802
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 333 place count 367 transition count 802
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 9 rules applied. Total rules applied 342 place count 363 transition count 797
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 347 place count 358 transition count 797
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 347 place count 358 transition count 788
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 365 place count 349 transition count 788
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 372 place count 342 transition count 768
Iterating global reduction 5 with 7 rules applied. Total rules applied 379 place count 342 transition count 768
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 5 with 23 rules applied. Total rules applied 402 place count 336 transition count 751
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 416 place count 322 transition count 751
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 416 place count 322 transition count 750
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 418 place count 321 transition count 750
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 422 place count 317 transition count 739
Iterating global reduction 7 with 4 rules applied. Total rules applied 426 place count 317 transition count 739
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 429 place count 317 transition count 736
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 430 place count 316 transition count 728
Iterating global reduction 8 with 1 rules applied. Total rules applied 431 place count 316 transition count 728
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 432 place count 315 transition count 720
Iterating global reduction 8 with 1 rules applied. Total rules applied 433 place count 315 transition count 720
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 434 place count 314 transition count 712
Iterating global reduction 8 with 1 rules applied. Total rules applied 435 place count 314 transition count 712
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 436 place count 313 transition count 704
Iterating global reduction 8 with 1 rules applied. Total rules applied 437 place count 313 transition count 704
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 438 place count 312 transition count 696
Iterating global reduction 8 with 1 rules applied. Total rules applied 439 place count 312 transition count 696
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 440 place count 311 transition count 688
Iterating global reduction 8 with 1 rules applied. Total rules applied 441 place count 311 transition count 688
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 442 place count 310 transition count 680
Iterating global reduction 8 with 1 rules applied. Total rules applied 443 place count 310 transition count 680
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 444 place count 309 transition count 672
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 309 transition count 672
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 446 place count 308 transition count 664
Iterating global reduction 8 with 1 rules applied. Total rules applied 447 place count 308 transition count 664
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 448 place count 307 transition count 656
Iterating global reduction 8 with 1 rules applied. Total rules applied 449 place count 307 transition count 656
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 450 place count 306 transition count 648
Iterating global reduction 8 with 1 rules applied. Total rules applied 451 place count 306 transition count 648
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 452 place count 305 transition count 640
Iterating global reduction 8 with 1 rules applied. Total rules applied 453 place count 305 transition count 640
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 454 place count 304 transition count 632
Iterating global reduction 8 with 1 rules applied. Total rules applied 455 place count 304 transition count 632
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 456 place count 303 transition count 624
Iterating global reduction 8 with 1 rules applied. Total rules applied 457 place count 303 transition count 624
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 458 place count 302 transition count 616
Iterating global reduction 8 with 1 rules applied. Total rules applied 459 place count 302 transition count 616
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 517 place count 273 transition count 587
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 519 place count 271 transition count 585
Iterating global reduction 8 with 2 rules applied. Total rules applied 521 place count 271 transition count 585
Applied a total of 521 rules in 185 ms. Remains 271 /547 variables (removed 276) and now considering 585/958 (removed 373) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12340838945401113539.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14214807088499976768.kers'
[2026-05-22 17:30:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12340838945401113539.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14214807088499976768.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 585 rows 271 cols 2343 entries
Finished phase 1 with 98 SingleSign rule and 134 generalized
[2026-05-22 17:30:26] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14214807088499976768.kers
Total runtime 3 ms.
[2026-05-22 17:30:26] [INFO ] Implicit Places using invariants in 298 ms returned [0, 76, 93, 99, 104, 112, 165, 186, 192, 197, 199, 202, 268]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 301 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/547 places, 585/958 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 258 transition count 577
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 250 transition count 577
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 246 transition count 573
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 246 transition count 573
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 242 transition count 569
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 242 transition count 569
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 240 transition count 567
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 240 transition count 567
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 234 transition count 561
Applied a total of 48 rules in 58 ms. Remains 234 /258 variables (removed 24) and now considering 561/585 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6276818573965866460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18039555638188859056.kers'
[2026-05-22 17:30:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6276818573965866460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18039555638188859056.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 561 rows 234 cols 2254 entries
Finished phase 1 with 101 SingleSign rule and 107 generalized
[2026-05-22 17:30:26] [INFO ] Computed 26 invariants in 2 ms
Computed 26 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18039555638188859056.kers
Total runtime 3 ms.
[2026-05-22 17:30:27] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-22 17:30:27] [INFO ] Invariant cache hit.
[2026-05-22 17:30:27] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 234/547 places, 561/958 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1109 ms. Remains : 234/547 places, 561/958 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(((F(X(p0))&&F(p0)) U p1)))))'
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-13
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-13 finished in 1210 ms.
All properties solved by simple procedures.
Total runtime 83287 ms.

BK_STOP 1779471027674

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02a"
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 ASLink-PT-02a, 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 r002-oct2-177944366100300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;